/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:47:39,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:47:39,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:47:39,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:47:39,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:47:39,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:47:39,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:47:39,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:47:39,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:47:39,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:47:39,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:47:39,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:47:39,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:47:39,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:47:39,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:47:39,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:47:39,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:47:39,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:47:39,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:47:39,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:47:39,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:47:39,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:47:39,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:47:39,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:47:39,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:47:39,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:47:39,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:47:39,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:47:39,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:47:39,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:47:39,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:47:39,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:47:39,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:47:39,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:47:39,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:47:39,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:47:39,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:47:39,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:47:39,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:47:39,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:47:39,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:47:39,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:47:39,986 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:47:39,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:47:39,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:47:39,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:47:39,989 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:47:39,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:47:39,989 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:47:39,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:47:39,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:47:39,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:47:39,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:47:39,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:47:39,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:47:39,992 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:47:39,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:47:39,993 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:47:39,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:47:39,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:47:39,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:47:39,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:47:39,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:47:39,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:47:39,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:47:39,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:47:39,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:47:39,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:47:39,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:47:39,995 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:47:39,995 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:47:39,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:47:39,996 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:47:40,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:47:40,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:47:40,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:47:40,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:47:40,282 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:47:40,283 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-06 00:47:40,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a195ba57/dcca5263fdaf4eabbe0da8a61583d710/FLAG89a976d22 [2020-10-06 00:47:40,976 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:47:40,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-06 00:47:40,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a195ba57/dcca5263fdaf4eabbe0da8a61583d710/FLAG89a976d22 [2020-10-06 00:47:41,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a195ba57/dcca5263fdaf4eabbe0da8a61583d710 [2020-10-06 00:47:41,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:47:41,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:47:41,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:47:41,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:47:41,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:47:41,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:47:41" (1/1) ... [2020-10-06 00:47:41,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c7afa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:41, skipping insertion in model container [2020-10-06 00:47:41,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:47:41" (1/1) ... [2020-10-06 00:47:41,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:47:41,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:47:41,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:47:41,911 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:47:41,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:47:42,065 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:47:42,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42 WrapperNode [2020-10-06 00:47:42,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:47:42,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:47:42,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:47:42,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:47:42,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:47:42,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:47:42,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:47:42,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:47:42,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:47:42,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:47:42,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:47:42,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:47:42,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:47:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:47:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:47:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:47:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:47:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:47:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:47:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:47:42,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:47:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:47:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:47:42,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:47:42,236 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:47:44,175 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:47:44,175 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:47:44,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:47:44 BoogieIcfgContainer [2020-10-06 00:47:44,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:47:44,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:47:44,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:47:44,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:47:44,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:47:41" (1/3) ... [2020-10-06 00:47:44,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e08bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:47:44, skipping insertion in model container [2020-10-06 00:47:44,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42" (2/3) ... [2020-10-06 00:47:44,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e08bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:47:44, skipping insertion in model container [2020-10-06 00:47:44,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:47:44" (3/3) ... [2020-10-06 00:47:44,190 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2020-10-06 00:47:44,202 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:47:44,202 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:47:44,211 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:47:44,212 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:47:44,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,262 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,263 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,267 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,267 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:44,310 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 00:47:44,336 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:47:44,337 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:47:44,337 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:47:44,337 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:47:44,337 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:47:44,338 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:47:44,338 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:47:44,338 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:47:44,356 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:44,358 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:44,411 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 00:47:44,411 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:47:44,418 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 00:47:44,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:44,460 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 00:47:44,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:47:44,461 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 00:47:44,464 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 888 [2020-10-06 00:47:44,465 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:47:44,775 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-06 00:47:46,314 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-06 00:47:46,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 00:47:46,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:47:46,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-06 00:47:46,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:47:47,215 WARN L193 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-06 00:47:47,855 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-06 00:47:47,981 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-06 00:47:48,888 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-06 00:47:49,017 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-06 00:47:49,023 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2408 [2020-10-06 00:47:49,023 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-06 00:47:49,027 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-06 00:47:49,048 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2020-10-06 00:47:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2020-10-06 00:47:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-06 00:47:49,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:49,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-06 00:47:49,058 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash 861621042, now seen corresponding path program 1 times [2020-10-06 00:47:49,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:49,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115270624] [2020-10-06 00:47:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:49,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115270624] [2020-10-06 00:47:49,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:49,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:47:49,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2025612681] [2020-10-06 00:47:49,312 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:49,315 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:49,328 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-06 00:47:49,329 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:49,333 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:49,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:47:49,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:47:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:47:49,350 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2020-10-06 00:47:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:49,409 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-06 00:47:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:47:49,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-06 00:47:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:49,423 INFO L225 Difference]: With dead ends: 187 [2020-10-06 00:47:49,424 INFO L226 Difference]: Without dead ends: 137 [2020-10-06 00:47:49,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:47:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-06 00:47:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-06 00:47:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-06 00:47:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-06 00:47:49,481 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-06 00:47:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:49,482 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-06 00:47:49,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:47:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-06 00:47:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 00:47:49,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:49,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:49,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:47:49,484 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1829495527, now seen corresponding path program 1 times [2020-10-06 00:47:49,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:49,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881266952] [2020-10-06 00:47:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:49,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881266952] [2020-10-06 00:47:49,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:49,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:47:49,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [695482074] [2020-10-06 00:47:49,690 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:49,691 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:49,693 INFO L258 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-06 00:47:49,693 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:49,694 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:49,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:47:49,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:47:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:47:49,696 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-06 00:47:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:49,803 INFO L93 Difference]: Finished difference Result 158 states and 350 transitions. [2020-10-06 00:47:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:47:49,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-06 00:47:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:49,808 INFO L225 Difference]: With dead ends: 158 [2020-10-06 00:47:49,809 INFO L226 Difference]: Without dead ends: 133 [2020-10-06 00:47:49,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:47:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-06 00:47:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-10-06 00:47:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-06 00:47:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2020-10-06 00:47:49,833 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 8 [2020-10-06 00:47:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:49,833 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2020-10-06 00:47:49,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:47:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2020-10-06 00:47:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:47:49,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:49,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:49,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:47:49,836 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 879762521, now seen corresponding path program 1 times [2020-10-06 00:47:49,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:49,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91698957] [2020-10-06 00:47:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:49,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91698957] [2020-10-06 00:47:49,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:49,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:49,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291607613] [2020-10-06 00:47:49,968 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:49,969 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:49,971 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:47:49,971 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:49,972 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:49,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:47:49,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:47:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:47:49,973 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand 6 states. [2020-10-06 00:47:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,115 INFO L93 Difference]: Finished difference Result 145 states and 319 transitions. [2020-10-06 00:47:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:50,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-06 00:47:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,117 INFO L225 Difference]: With dead ends: 145 [2020-10-06 00:47:50,117 INFO L226 Difference]: Without dead ends: 125 [2020-10-06 00:47:50,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-06 00:47:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-06 00:47:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-06 00:47:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 284 transitions. [2020-10-06 00:47:50,129 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 284 transitions. Word has length 9 [2020-10-06 00:47:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,130 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 284 transitions. [2020-10-06 00:47:50,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:47:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 284 transitions. [2020-10-06 00:47:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 00:47:50,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:47:50,132 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1831308448, now seen corresponding path program 1 times [2020-10-06 00:47:50,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000091511] [2020-10-06 00:47:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000091511] [2020-10-06 00:47:50,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:50,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454999914] [2020-10-06 00:47:50,241 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,243 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,245 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-06 00:47:50,245 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,288 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:47:50,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:47:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:47:50,290 INFO L87 Difference]: Start difference. First operand 125 states and 284 transitions. Second operand 6 states. [2020-10-06 00:47:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,400 INFO L93 Difference]: Finished difference Result 135 states and 296 transitions. [2020-10-06 00:47:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:50,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-06 00:47:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,411 INFO L225 Difference]: With dead ends: 135 [2020-10-06 00:47:50,411 INFO L226 Difference]: Without dead ends: 120 [2020-10-06 00:47:50,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-06 00:47:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-06 00:47:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-06 00:47:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 268 transitions. [2020-10-06 00:47:50,431 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 268 transitions. Word has length 10 [2020-10-06 00:47:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,432 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 268 transitions. [2020-10-06 00:47:50,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:47:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 268 transitions. [2020-10-06 00:47:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:47:50,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:47:50,434 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 935963072, now seen corresponding path program 1 times [2020-10-06 00:47:50,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362669039] [2020-10-06 00:47:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362669039] [2020-10-06 00:47:50,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:47:50,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66865300] [2020-10-06 00:47:50,563 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,565 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,568 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-06 00:47:50,568 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,586 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:47:50,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:47:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:50,587 INFO L87 Difference]: Start difference. First operand 119 states and 268 transitions. Second operand 7 states. [2020-10-06 00:47:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,760 INFO L93 Difference]: Finished difference Result 143 states and 311 transitions. [2020-10-06 00:47:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:47:50,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-06 00:47:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,762 INFO L225 Difference]: With dead ends: 143 [2020-10-06 00:47:50,762 INFO L226 Difference]: Without dead ends: 127 [2020-10-06 00:47:50,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:47:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-06 00:47:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-06 00:47:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-06 00:47:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 282 transitions. [2020-10-06 00:47:50,771 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 282 transitions. Word has length 11 [2020-10-06 00:47:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,771 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 282 transitions. [2020-10-06 00:47:50,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:47:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 282 transitions. [2020-10-06 00:47:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:47:50,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:47:50,774 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -657848166, now seen corresponding path program 1 times [2020-10-06 00:47:50,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073881943] [2020-10-06 00:47:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073881943] [2020-10-06 00:47:50,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:47:50,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889015974] [2020-10-06 00:47:50,903 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,905 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,907 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:47:50,908 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,908 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:47:50,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:47:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:47:50,910 INFO L87 Difference]: Start difference. First operand 127 states and 282 transitions. Second operand 4 states. [2020-10-06 00:47:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,932 INFO L93 Difference]: Finished difference Result 108 states and 202 transitions. [2020-10-06 00:47:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:47:50,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-06 00:47:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,936 INFO L225 Difference]: With dead ends: 108 [2020-10-06 00:47:50,937 INFO L226 Difference]: Without dead ends: 79 [2020-10-06 00:47:50,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:47:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-06 00:47:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-06 00:47:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-06 00:47:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2020-10-06 00:47:50,942 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 11 [2020-10-06 00:47:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,942 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2020-10-06 00:47:50,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:47:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2020-10-06 00:47:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:47:50,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:47:50,947 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1314571888, now seen corresponding path program 1 times [2020-10-06 00:47:50,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234756514] [2020-10-06 00:47:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234756514] [2020-10-06 00:47:51,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:51,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190546834] [2020-10-06 00:47:51,027 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,029 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,031 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-06 00:47:51,031 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:51,032 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:51,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:47:51,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:47:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:47:51,033 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 5 states. [2020-10-06 00:47:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:51,072 INFO L93 Difference]: Finished difference Result 56 states and 90 transitions. [2020-10-06 00:47:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:47:51,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-06 00:47:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:51,074 INFO L225 Difference]: With dead ends: 56 [2020-10-06 00:47:51,074 INFO L226 Difference]: Without dead ends: 45 [2020-10-06 00:47:51,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-06 00:47:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-10-06 00:47:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-06 00:47:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-06 00:47:51,078 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-06 00:47:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,078 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-06 00:47:51,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:47:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-06 00:47:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:47:51,080 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash -299715963, now seen corresponding path program 1 times [2020-10-06 00:47:51,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196983228] [2020-10-06 00:47:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196983228] [2020-10-06 00:47:51,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:47:51,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796571091] [2020-10-06 00:47:51,186 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,189 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,197 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 38 transitions. [2020-10-06 00:47:51,197 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:51,257 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:51,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:47:51,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:47:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:51,259 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 7 states. [2020-10-06 00:47:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:51,325 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-06 00:47:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:47:51,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-06 00:47:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:51,327 INFO L225 Difference]: With dead ends: 60 [2020-10-06 00:47:51,327 INFO L226 Difference]: Without dead ends: 29 [2020-10-06 00:47:51,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:47:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-06 00:47:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-06 00:47:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-06 00:47:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-06 00:47:51,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-06 00:47:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,330 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-06 00:47:51,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:47:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-06 00:47:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:47:51,331 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1056418205, now seen corresponding path program 2 times [2020-10-06 00:47:51,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294137596] [2020-10-06 00:47:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294137596] [2020-10-06 00:47:51,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:47:51,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604017701] [2020-10-06 00:47:51,446 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,450 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,456 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 26 transitions. [2020-10-06 00:47:51,456 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:51,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:47:51,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:47:51,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:47:51,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:47:51,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,608 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:47:51,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,655 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:47:51,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:47:51,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,687 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:47:51,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,691 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:47:51,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:51,703 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:47:51,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:47:51,739 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3173#(or (= ~y~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-06 00:47:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:47:51,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:47:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:51,740 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 8 states. [2020-10-06 00:47:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:51,851 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-06 00:47:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:47:51,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-06 00:47:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:51,852 INFO L225 Difference]: With dead ends: 44 [2020-10-06 00:47:51,852 INFO L226 Difference]: Without dead ends: 29 [2020-10-06 00:47:51,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:47:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-06 00:47:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-06 00:47:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-06 00:47:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-10-06 00:47:51,855 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-10-06 00:47:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,855 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-10-06 00:47:51,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:47:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-10-06 00:47:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:47:51,856 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 563187007, now seen corresponding path program 3 times [2020-10-06 00:47:51,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894769463] [2020-10-06 00:47:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894769463] [2020-10-06 00:47:51,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:47:51,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410785963] [2020-10-06 00:47:51,979 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,982 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,987 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-10-06 00:47:51,987 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:52,032 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3289#(and (= ~y~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-06 00:47:52,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:47:52,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:47:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:52,033 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 8 states. [2020-10-06 00:47:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:52,094 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2020-10-06 00:47:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:52,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-06 00:47:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:52,095 INFO L225 Difference]: With dead ends: 38 [2020-10-06 00:47:52,095 INFO L226 Difference]: Without dead ends: 25 [2020-10-06 00:47:52,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:47:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-06 00:47:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-06 00:47:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-06 00:47:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-06 00:47:52,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-06 00:47:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:52,097 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-06 00:47:52,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:47:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-06 00:47:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:52,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:52,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:52,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:47:52,099 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash -869615873, now seen corresponding path program 4 times [2020-10-06 00:47:52,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:52,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449439671] [2020-10-06 00:47:52,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:52,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449439671] [2020-10-06 00:47:52,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:52,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 00:47:52,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568017438] [2020-10-06 00:47:52,314 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:52,318 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:52,323 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-06 00:47:52,324 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:52,335 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:47:52,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:47:52,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,339 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:47:52,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,341 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:47:52,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,345 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:47:52,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:52,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:52,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:47:52,435 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:47:52,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:52,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:47:52,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:52,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 00:47:52,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,498 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:52,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:47:52,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:47:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:47:52,500 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 9 states. [2020-10-06 00:47:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:52,778 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-06 00:47:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:47:52,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-06 00:47:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:52,779 INFO L225 Difference]: With dead ends: 34 [2020-10-06 00:47:52,779 INFO L226 Difference]: Without dead ends: 21 [2020-10-06 00:47:52,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-06 00:47:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-06 00:47:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-06 00:47:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-06 00:47:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-06 00:47:52,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-06 00:47:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:52,781 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-06 00:47:52,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:47:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-06 00:47:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:52,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:52,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:52,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:47:52,783 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1239204549, now seen corresponding path program 5 times [2020-10-06 00:47:52,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:52,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630239748] [2020-10-06 00:47:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:47:52,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:47:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:47:52,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:47:52,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:47:52,934 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:47:52,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 00:47:52,949 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:53,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:47:53 BasicIcfg [2020-10-06 00:47:53,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:47:53,031 INFO L168 Benchmark]: Toolchain (without parser) took 11740.62 ms. Allocated memory was 140.5 MB in the beginning and 357.6 MB in the end (delta: 217.1 MB). Free memory was 101.7 MB in the beginning and 293.1 MB in the end (delta: -191.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,032 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.02 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.5 MB in the beginning and 155.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.36 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,038 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,039 INFO L168 Benchmark]: RCFGBuilder took 2011.41 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 150.3 MB in the beginning and 194.8 MB in the end (delta: -44.5 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,041 INFO L168 Benchmark]: TraceAbstraction took 8849.94 ms. Allocated memory was 246.4 MB in the beginning and 357.6 MB in the end (delta: 111.1 MB). Free memory was 193.0 MB in the beginning and 293.1 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:53,051 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.02 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.5 MB in the beginning and 155.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.36 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.88 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2011.41 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 150.3 MB in the beginning and 194.8 MB in the end (delta: -44.5 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8849.94 ms. Allocated memory was 246.4 MB in the beginning and 357.6 MB in the end (delta: 111.1 MB). Free memory was 193.0 MB in the beginning and 293.1 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 80 ProgramPointsBefore, 28 ProgramPointsAfterwards, 75 TransitionsBefore, 22 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 424 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2408 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1453; [L782] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 0 pthread_t t1454; [L784] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L759] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L801] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L802] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L802] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L804] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L804] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 186 SDtfs, 239 SDslu, 391 SDs, 0 SdLazy, 283 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 11596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...