./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe012_pso.oepc_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/protection/safe012_pso.oepc_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:55:26,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:55:26,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:55:26,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:55:26,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:55:26,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:55:26,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:55:26,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:55:26,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:55:26,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:55:26,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:55:26,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:55:26,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:55:26,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:55:26,533 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:55:26,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:55:26,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:55:26,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:55:26,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:55:26,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:55:26,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:55:26,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:55:26,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:55:26,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:55:26,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:55:26,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:55:26,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:55:26,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:55:26,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:55:26,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:55:26,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:55:26,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:55:26,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:55:26,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:55:26,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:55:26,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:55:26,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:55:26,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:55:26,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:55:26,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:55:26,539 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:55:26,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:55:26,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:55:26,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:55:26,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:55:26,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:55:26,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:55:26,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:55:26,766 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:55:26,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 18:55:27,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:55:27,916 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:55:27,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 18:55:27,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dddcfce6/b6ea6821c8ca49e5a7fcb2fefebbceea/FLAGa013881ab [2024-06-27 18:55:27,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dddcfce6/b6ea6821c8ca49e5a7fcb2fefebbceea [2024-06-27 18:55:27,959 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:55:27,960 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:55:27,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe012_pso.oepc_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 18:55:28,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:55:28,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:55:28,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:55:28,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:55:28,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:55:28,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:55:27" (1/2) ... [2024-06-27 18:55:28,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b53c90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:55:28, skipping insertion in model container [2024-06-27 18:55:28,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:55:27" (1/2) ... [2024-06-27 18:55:28,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c73c226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:55:28, skipping insertion in model container [2024-06-27 18:55:28,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:55:28" (2/2) ... [2024-06-27 18:55:28,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b53c90e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28, skipping insertion in model container [2024-06-27 18:55:28,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:55:28" (2/2) ... [2024-06-27 18:55:28,099 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:55:28,213 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:55:28,214 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) [2024-06-27 18:55:28,214 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) [2024-06-27 18:55:28,215 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) [2024-06-27 18:55:28,215 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:55:28,215 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-27 18:55:28,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:55:28,370 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2024-06-27 18:55:28,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:55:28,537 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:55:28,566 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:55:28,645 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:55:28,684 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:55:28,685 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28 WrapperNode [2024-06-27 18:55:28,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:55:28,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:55:28,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:55:28,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:55:28,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,752 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2024-06-27 18:55:28,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:55:28,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:55:28,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:55:28,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:55:28,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:55:28,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:55:28,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:55:28,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:55:28,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:55:28,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (1/1) ... [2024-06-27 18:55:28,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:55:28,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:55:28,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:55:28,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:55:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:55:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:55:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:55:28,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:55:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:55:28,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:55:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 18:55:28,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 18:55:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:55:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:55:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:55:28,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:55:28,888 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:55:29,015 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:55:29,018 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:55:29,257 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:55:29,257 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:55:29,424 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:55:29,424 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:55:29,425 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:55:29 BoogieIcfgContainer [2024-06-27 18:55:29,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:55:29,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:55:29,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:55:29,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:55:29,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:55:27" (1/4) ... [2024-06-27 18:55:29,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aad40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:55:29, skipping insertion in model container [2024-06-27 18:55:29,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:55:28" (2/4) ... [2024-06-27 18:55:29,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aad40f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:55:29, skipping insertion in model container [2024-06-27 18:55:29,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:55:28" (3/4) ... [2024-06-27 18:55:29,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aad40f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:55:29, skipping insertion in model container [2024-06-27 18:55:29,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:55:29" (4/4) ... [2024-06-27 18:55:29,434 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 18:55:29,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:55:29,447 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 18:55:29,447 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:55:29,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:55:29,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 18:55:29,549 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-27 18:55:29,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:55:29,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-27 18:55:29,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 18:55:29,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-27 18:55:29,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:55:29,574 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@700dc4d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:55:29,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 18:55:29,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:55:29,579 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 18:55:29,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:55:29,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:29,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:55:29,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:29,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash 345513232, now seen corresponding path program 1 times [2024-06-27 18:55:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086842846] [2024-06-27 18:55:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086842846] [2024-06-27 18:55:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086842846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:55:30,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771671490] [2024-06-27 18:55:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:30,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:55:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:55:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:55:30,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 18:55:30,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:30,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:30,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 18:55:30,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:30,901 INFO L124 PetriNetUnfolderBase]: 2396/3521 cut-off events. [2024-06-27 18:55:30,901 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 18:55:30,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7091 conditions, 3521 events. 2396/3521 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19148 event pairs, 1064 based on Foata normal form. 142/3468 useless extension candidates. Maximal degree in co-relation 7079. Up to 3464 conditions per place. [2024-06-27 18:55:30,951 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 40 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-06-27 18:55:30,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 221 flow [2024-06-27 18:55:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:55:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:55:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 18:55:30,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2024-06-27 18:55:30,964 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 98 transitions. [2024-06-27 18:55:30,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 221 flow [2024-06-27 18:55:30,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:55:30,971 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 127 flow [2024-06-27 18:55:30,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-27 18:55:30,975 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 18:55:30,976 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 127 flow [2024-06-27 18:55:30,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:30,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:30,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:30,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:55:30,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:30,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1851525318, now seen corresponding path program 1 times [2024-06-27 18:55:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697442057] [2024-06-27 18:55:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697442057] [2024-06-27 18:55:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697442057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:55:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630675931] [2024-06-27 18:55:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:31,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:55:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:55:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:55:31,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 46 [2024-06-27 18:55:31,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:31,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:31,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 46 [2024-06-27 18:55:31,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:31,283 INFO L124 PetriNetUnfolderBase]: 740/1509 cut-off events. [2024-06-27 18:55:31,283 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-06-27 18:55:31,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1509 events. 740/1509 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10218 event pairs, 385 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 2863. Up to 943 conditions per place. [2024-06-27 18:55:31,291 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-06-27 18:55:31,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 210 flow [2024-06-27 18:55:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:55:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:55:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 18:55:31,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-06-27 18:55:31,295 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 127 flow. Second operand 3 states and 105 transitions. [2024-06-27 18:55:31,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 210 flow [2024-06-27 18:55:31,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:55:31,297 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 120 flow [2024-06-27 18:55:31,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 18:55:31,298 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 18:55:31,298 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 120 flow [2024-06-27 18:55:31,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:31,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:31,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:31,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:55:31,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:31,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1277831302, now seen corresponding path program 1 times [2024-06-27 18:55:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336956174] [2024-06-27 18:55:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336956174] [2024-06-27 18:55:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336956174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:55:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828640076] [2024-06-27 18:55:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:32,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:55:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:55:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:55:32,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 18:55:32,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:32,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:32,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 18:55:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:32,752 INFO L124 PetriNetUnfolderBase]: 2591/4379 cut-off events. [2024-06-27 18:55:32,753 INFO L125 PetriNetUnfolderBase]: For 1016/1030 co-relation queries the response was YES. [2024-06-27 18:55:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9204 conditions, 4379 events. 2591/4379 cut-off events. For 1016/1030 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27590 event pairs, 1657 based on Foata normal form. 13/4236 useless extension candidates. Maximal degree in co-relation 9191. Up to 3663 conditions per place. [2024-06-27 18:55:32,774 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 46 selfloop transitions, 6 changer transitions 3/67 dead transitions. [2024-06-27 18:55:32,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 286 flow [2024-06-27 18:55:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:55:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:55:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-06-27 18:55:32,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2024-06-27 18:55:32,776 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 120 flow. Second operand 4 states and 118 transitions. [2024-06-27 18:55:32,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 286 flow [2024-06-27 18:55:32,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:32,779 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 139 flow [2024-06-27 18:55:32,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-06-27 18:55:32,780 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-06-27 18:55:32,780 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 139 flow [2024-06-27 18:55:32,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:32,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:32,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:55:32,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:32,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1200581411, now seen corresponding path program 1 times [2024-06-27 18:55:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662829918] [2024-06-27 18:55:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662829918] [2024-06-27 18:55:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662829918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:55:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829720403] [2024-06-27 18:55:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:33,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:55:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:55:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:55:33,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-06-27 18:55:33,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:33,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:33,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-06-27 18:55:33,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:33,777 INFO L124 PetriNetUnfolderBase]: 2049/3483 cut-off events. [2024-06-27 18:55:33,777 INFO L125 PetriNetUnfolderBase]: For 1340/1344 co-relation queries the response was YES. [2024-06-27 18:55:33,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7742 conditions, 3483 events. 2049/3483 cut-off events. For 1340/1344 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21439 event pairs, 973 based on Foata normal form. 6/3363 useless extension candidates. Maximal degree in co-relation 7727. Up to 2957 conditions per place. [2024-06-27 18:55:33,793 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 49 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2024-06-27 18:55:33,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 325 flow [2024-06-27 18:55:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:55:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:55:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 18:55:33,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-06-27 18:55:33,795 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 139 flow. Second operand 5 states and 125 transitions. [2024-06-27 18:55:33,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 325 flow [2024-06-27 18:55:33,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:33,797 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 195 flow [2024-06-27 18:55:33,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-27 18:55:33,798 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-06-27 18:55:33,798 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 195 flow [2024-06-27 18:55:33,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:33,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:33,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:33,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:55:33,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:33,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1436683410, now seen corresponding path program 1 times [2024-06-27 18:55:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189308467] [2024-06-27 18:55:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189308467] [2024-06-27 18:55:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189308467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:34,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:55:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652148826] [2024-06-27 18:55:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:34,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:55:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:55:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:55:34,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:34,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:34,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:34,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:34,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:34,855 INFO L124 PetriNetUnfolderBase]: 2490/4200 cut-off events. [2024-06-27 18:55:34,856 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES. [2024-06-27 18:55:34,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10449 conditions, 4200 events. 2490/4200 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 26580 event pairs, 1165 based on Foata normal form. 4/4053 useless extension candidates. Maximal degree in co-relation 10431. Up to 3535 conditions per place. [2024-06-27 18:55:34,876 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 66 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-06-27 18:55:34,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 465 flow [2024-06-27 18:55:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:55:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:55:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-27 18:55:34,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2024-06-27 18:55:34,877 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 195 flow. Second operand 6 states and 146 transitions. [2024-06-27 18:55:34,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 465 flow [2024-06-27 18:55:34,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 444 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:34,880 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 275 flow [2024-06-27 18:55:34,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-06-27 18:55:34,881 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2024-06-27 18:55:34,881 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 275 flow [2024-06-27 18:55:34,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:34,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:34,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:34,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:55:34,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:34,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1587514268, now seen corresponding path program 1 times [2024-06-27 18:55:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773596005] [2024-06-27 18:55:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773596005] [2024-06-27 18:55:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773596005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:35,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:55:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823449469] [2024-06-27 18:55:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:35,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:55:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:55:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:55:35,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:35,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:35,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:35,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:35,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:36,236 INFO L124 PetriNetUnfolderBase]: 2524/4206 cut-off events. [2024-06-27 18:55:36,237 INFO L125 PetriNetUnfolderBase]: For 4638/4638 co-relation queries the response was YES. [2024-06-27 18:55:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11401 conditions, 4206 events. 2524/4206 cut-off events. For 4638/4638 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 26336 event pairs, 970 based on Foata normal form. 6/4063 useless extension candidates. Maximal degree in co-relation 11379. Up to 3484 conditions per place. [2024-06-27 18:55:36,256 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 77 selfloop transitions, 25 changer transitions 0/112 dead transitions. [2024-06-27 18:55:36,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 659 flow [2024-06-27 18:55:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-27 18:55:36,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2024-06-27 18:55:36,258 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 275 flow. Second operand 7 states and 176 transitions. [2024-06-27 18:55:36,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 659 flow [2024-06-27 18:55:36,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 653 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 18:55:36,263 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 445 flow [2024-06-27 18:55:36,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2024-06-27 18:55:36,263 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2024-06-27 18:55:36,264 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 445 flow [2024-06-27 18:55:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:36,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:36,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:55:36,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:36,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1991920274, now seen corresponding path program 1 times [2024-06-27 18:55:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580172624] [2024-06-27 18:55:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:36,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:36,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580172624] [2024-06-27 18:55:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580172624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:36,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:36,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:55:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947817035] [2024-06-27 18:55:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:55:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:55:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:55:37,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:37,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 445 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:37,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:37,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:37,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:37,598 INFO L124 PetriNetUnfolderBase]: 2990/4709 cut-off events. [2024-06-27 18:55:37,599 INFO L125 PetriNetUnfolderBase]: For 10159/10220 co-relation queries the response was YES. [2024-06-27 18:55:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15217 conditions, 4709 events. 2990/4709 cut-off events. For 10159/10220 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 27461 event pairs, 844 based on Foata normal form. 3/4564 useless extension candidates. Maximal degree in co-relation 15189. Up to 4094 conditions per place. [2024-06-27 18:55:37,622 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 64 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2024-06-27 18:55:37,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 101 transitions, 705 flow [2024-06-27 18:55:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:55:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:55:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 18:55:37,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-06-27 18:55:37,624 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 445 flow. Second operand 5 states and 125 transitions. [2024-06-27 18:55:37,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 101 transitions, 705 flow [2024-06-27 18:55:37,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 685 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-27 18:55:37,635 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 513 flow [2024-06-27 18:55:37,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=513, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2024-06-27 18:55:37,636 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-06-27 18:55:37,636 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 513 flow [2024-06-27 18:55:37,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:37,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:37,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:37,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:55:37,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:37,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1968303601, now seen corresponding path program 1 times [2024-06-27 18:55:37,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:37,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373223582] [2024-06-27 18:55:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373223582] [2024-06-27 18:55:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373223582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:55:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735535271] [2024-06-27 18:55:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:38,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:55:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:55:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:55:38,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:38,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 513 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:38,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:38,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:38,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:39,310 INFO L124 PetriNetUnfolderBase]: 2700/4509 cut-off events. [2024-06-27 18:55:39,310 INFO L125 PetriNetUnfolderBase]: For 12248/12248 co-relation queries the response was YES. [2024-06-27 18:55:39,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14892 conditions, 4509 events. 2700/4509 cut-off events. For 12248/12248 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 28558 event pairs, 974 based on Foata normal form. 24/4387 useless extension candidates. Maximal degree in co-relation 14861. Up to 3560 conditions per place. [2024-06-27 18:55:39,338 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 103 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2024-06-27 18:55:39,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 131 transitions, 928 flow [2024-06-27 18:55:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 18:55:39,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5407608695652174 [2024-06-27 18:55:39,340 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 513 flow. Second operand 8 states and 199 transitions. [2024-06-27 18:55:39,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 131 transitions, 928 flow [2024-06-27 18:55:39,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 880 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 18:55:39,351 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 552 flow [2024-06-27 18:55:39,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=552, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2024-06-27 18:55:39,353 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-06-27 18:55:39,353 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 552 flow [2024-06-27 18:55:39,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:39,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:39,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:39,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:55:39,354 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:39,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1168258719, now seen corresponding path program 1 times [2024-06-27 18:55:39,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:39,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007694125] [2024-06-27 18:55:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007694125] [2024-06-27 18:55:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007694125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:55:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129341067] [2024-06-27 18:55:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:39,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:55:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:55:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:55:39,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:39,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:39,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:39,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:39,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:40,486 INFO L124 PetriNetUnfolderBase]: 3371/5620 cut-off events. [2024-06-27 18:55:40,486 INFO L125 PetriNetUnfolderBase]: For 12421/12421 co-relation queries the response was YES. [2024-06-27 18:55:40,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17884 conditions, 5620 events. 3371/5620 cut-off events. For 12421/12421 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 35688 event pairs, 1202 based on Foata normal form. 2/5444 useless extension candidates. Maximal degree in co-relation 17851. Up to 4838 conditions per place. [2024-06-27 18:55:40,576 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 92 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-06-27 18:55:40,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 112 transitions, 898 flow [2024-06-27 18:55:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:55:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:55:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 18:55:40,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:55:40,579 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 552 flow. Second operand 5 states and 115 transitions. [2024-06-27 18:55:40,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 112 transitions, 898 flow [2024-06-27 18:55:40,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:40,590 INFO L231 Difference]: Finished difference. Result has 82 places, 92 transitions, 642 flow [2024-06-27 18:55:40,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2024-06-27 18:55:40,591 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2024-06-27 18:55:40,591 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 642 flow [2024-06-27 18:55:40,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:40,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:40,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:55:40,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2057599157, now seen corresponding path program 1 times [2024-06-27 18:55:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418700458] [2024-06-27 18:55:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:41,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418700458] [2024-06-27 18:55:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418700458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:55:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843558281] [2024-06-27 18:55:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:41,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:55:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:55:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:55:41,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:41,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 642 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:41,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:41,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:41,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:42,126 INFO L124 PetriNetUnfolderBase]: 3231/5466 cut-off events. [2024-06-27 18:55:42,126 INFO L125 PetriNetUnfolderBase]: For 15045/15096 co-relation queries the response was YES. [2024-06-27 18:55:42,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18131 conditions, 5466 events. 3231/5466 cut-off events. For 15045/15096 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 35435 event pairs, 789 based on Foata normal form. 24/5208 useless extension candidates. Maximal degree in co-relation 18096. Up to 4488 conditions per place. [2024-06-27 18:55:42,158 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 86 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-06-27 18:55:42,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 127 transitions, 985 flow [2024-06-27 18:55:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:55:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:55:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-27 18:55:42,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-06-27 18:55:42,159 INFO L175 Difference]: Start difference. First operand has 82 places, 92 transitions, 642 flow. Second operand 6 states and 145 transitions. [2024-06-27 18:55:42,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 127 transitions, 985 flow [2024-06-27 18:55:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 979 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 18:55:42,172 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 786 flow [2024-06-27 18:55:42,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=786, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-27 18:55:42,173 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2024-06-27 18:55:42,173 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 786 flow [2024-06-27 18:55:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:42,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:42,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:42,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:55:42,174 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:42,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1060585427, now seen corresponding path program 2 times [2024-06-27 18:55:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278501685] [2024-06-27 18:55:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278501685] [2024-06-27 18:55:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278501685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:55:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563286640] [2024-06-27 18:55:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:43,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:55:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:55:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:55:43,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:55:43,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 786 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:43,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:43,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:55:43,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:43,978 INFO L124 PetriNetUnfolderBase]: 3188/5323 cut-off events. [2024-06-27 18:55:43,978 INFO L125 PetriNetUnfolderBase]: For 18759/18829 co-relation queries the response was YES. [2024-06-27 18:55:43,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18980 conditions, 5323 events. 3188/5323 cut-off events. For 18759/18829 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 34047 event pairs, 898 based on Foata normal form. 18/5083 useless extension candidates. Maximal degree in co-relation 18940. Up to 4366 conditions per place. [2024-06-27 18:55:44,010 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 87 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2024-06-27 18:55:44,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 1149 flow [2024-06-27 18:55:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:55:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:55:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 18:55:44,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2024-06-27 18:55:44,012 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 786 flow. Second operand 6 states and 148 transitions. [2024-06-27 18:55:44,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 1149 flow [2024-06-27 18:55:44,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 135 transitions, 1117 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:44,027 INFO L231 Difference]: Finished difference. Result has 94 places, 106 transitions, 886 flow [2024-06-27 18:55:44,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=94, PETRI_TRANSITIONS=106} [2024-06-27 18:55:44,028 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-06-27 18:55:44,028 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 106 transitions, 886 flow [2024-06-27 18:55:44,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:44,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:44,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:44,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:55:44,029 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:44,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 501264603, now seen corresponding path program 1 times [2024-06-27 18:55:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566770515] [2024-06-27 18:55:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566770515] [2024-06-27 18:55:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566770515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733601948] [2024-06-27 18:55:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:44,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:45,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:45,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 106 transitions, 886 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:45,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:45,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:45,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:45,830 INFO L124 PetriNetUnfolderBase]: 3444/5364 cut-off events. [2024-06-27 18:55:45,831 INFO L125 PetriNetUnfolderBase]: For 20556/20562 co-relation queries the response was YES. [2024-06-27 18:55:45,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20307 conditions, 5364 events. 3444/5364 cut-off events. For 20556/20562 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 31214 event pairs, 941 based on Foata normal form. 3/5274 useless extension candidates. Maximal degree in co-relation 20264. Up to 4642 conditions per place. [2024-06-27 18:55:45,868 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 119 selfloop transitions, 44 changer transitions 0/172 dead transitions. [2024-06-27 18:55:45,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 172 transitions, 1520 flow [2024-06-27 18:55:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 18:55:45,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2024-06-27 18:55:45,870 INFO L175 Difference]: Start difference. First operand has 94 places, 106 transitions, 886 flow. Second operand 8 states and 194 transitions. [2024-06-27 18:55:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 172 transitions, 1520 flow [2024-06-27 18:55:45,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 172 transitions, 1458 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-27 18:55:45,895 INFO L231 Difference]: Finished difference. Result has 103 places, 123 transitions, 1131 flow [2024-06-27 18:55:45,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1131, PETRI_PLACES=103, PETRI_TRANSITIONS=123} [2024-06-27 18:55:45,896 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2024-06-27 18:55:45,896 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 123 transitions, 1131 flow [2024-06-27 18:55:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:45,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:45,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:45,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:55:45,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:45,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 537985936, now seen corresponding path program 1 times [2024-06-27 18:55:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132528903] [2024-06-27 18:55:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132528903] [2024-06-27 18:55:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132528903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:46,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018929533] [2024-06-27 18:55:46,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:46,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:46,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:46,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:46,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 1131 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:46,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:46,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:46,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:47,550 INFO L124 PetriNetUnfolderBase]: 3481/5638 cut-off events. [2024-06-27 18:55:47,551 INFO L125 PetriNetUnfolderBase]: For 26316/26322 co-relation queries the response was YES. [2024-06-27 18:55:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22371 conditions, 5638 events. 3481/5638 cut-off events. For 26316/26322 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 35141 event pairs, 794 based on Foata normal form. 5/5496 useless extension candidates. Maximal degree in co-relation 22323. Up to 4877 conditions per place. [2024-06-27 18:55:47,591 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 139 selfloop transitions, 17 changer transitions 0/165 dead transitions. [2024-06-27 18:55:47,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 165 transitions, 1590 flow [2024-06-27 18:55:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-27 18:55:47,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062111801242236 [2024-06-27 18:55:47,593 INFO L175 Difference]: Start difference. First operand has 103 places, 123 transitions, 1131 flow. Second operand 7 states and 163 transitions. [2024-06-27 18:55:47,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 165 transitions, 1590 flow [2024-06-27 18:55:47,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 165 transitions, 1560 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-27 18:55:47,629 INFO L231 Difference]: Finished difference. Result has 111 places, 130 transitions, 1207 flow [2024-06-27 18:55:47,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1207, PETRI_PLACES=111, PETRI_TRANSITIONS=130} [2024-06-27 18:55:47,630 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-06-27 18:55:47,630 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 130 transitions, 1207 flow [2024-06-27 18:55:47,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:47,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:47,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:47,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:55:47,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:47,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash 608028568, now seen corresponding path program 2 times [2024-06-27 18:55:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:47,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696301133] [2024-06-27 18:55:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696301133] [2024-06-27 18:55:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696301133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:48,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:48,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:48,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476012535] [2024-06-27 18:55:48,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:48,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:48,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:48,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:48,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:48,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 1207 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:48,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:48,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:48,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:49,392 INFO L124 PetriNetUnfolderBase]: 3518/5679 cut-off events. [2024-06-27 18:55:49,392 INFO L125 PetriNetUnfolderBase]: For 29295/29301 co-relation queries the response was YES. [2024-06-27 18:55:49,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23236 conditions, 5679 events. 3518/5679 cut-off events. For 29295/29301 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34816 event pairs, 946 based on Foata normal form. 5/5519 useless extension candidates. Maximal degree in co-relation 23183. Up to 4827 conditions per place. [2024-06-27 18:55:49,427 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 138 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2024-06-27 18:55:49,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 1694 flow [2024-06-27 18:55:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 18:55:49,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:55:49,428 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 1207 flow. Second operand 7 states and 168 transitions. [2024-06-27 18:55:49,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 1694 flow [2024-06-27 18:55:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 172 transitions, 1659 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:49,460 INFO L231 Difference]: Finished difference. Result has 116 places, 133 transitions, 1263 flow [2024-06-27 18:55:49,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1263, PETRI_PLACES=116, PETRI_TRANSITIONS=133} [2024-06-27 18:55:49,461 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2024-06-27 18:55:49,461 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 133 transitions, 1263 flow [2024-06-27 18:55:49,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:49,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:49,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:49,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:55:49,462 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:49,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 627474256, now seen corresponding path program 3 times [2024-06-27 18:55:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837407173] [2024-06-27 18:55:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837407173] [2024-06-27 18:55:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837407173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33644266] [2024-06-27 18:55:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:50,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:50,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 133 transitions, 1263 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:50,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:50,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:50,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:51,282 INFO L124 PetriNetUnfolderBase]: 3518/5570 cut-off events. [2024-06-27 18:55:51,282 INFO L125 PetriNetUnfolderBase]: For 32894/32900 co-relation queries the response was YES. [2024-06-27 18:55:51,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23786 conditions, 5570 events. 3518/5570 cut-off events. For 32894/32900 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 33761 event pairs, 946 based on Foata normal form. 5/5440 useless extension candidates. Maximal degree in co-relation 23731. Up to 4741 conditions per place. [2024-06-27 18:55:51,311 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 139 selfloop transitions, 27 changer transitions 0/175 dead transitions. [2024-06-27 18:55:51,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 175 transitions, 1758 flow [2024-06-27 18:55:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 18:55:51,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:55:51,312 INFO L175 Difference]: Start difference. First operand has 116 places, 133 transitions, 1263 flow. Second operand 7 states and 168 transitions. [2024-06-27 18:55:51,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 175 transitions, 1758 flow [2024-06-27 18:55:51,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 175 transitions, 1697 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:51,342 INFO L231 Difference]: Finished difference. Result has 119 places, 137 transitions, 1318 flow [2024-06-27 18:55:51,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1318, PETRI_PLACES=119, PETRI_TRANSITIONS=137} [2024-06-27 18:55:51,343 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 67 predicate places. [2024-06-27 18:55:51,343 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 1318 flow [2024-06-27 18:55:51,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:51,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:51,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:51,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:55:51,344 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:51,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 627658830, now seen corresponding path program 1 times [2024-06-27 18:55:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475333681] [2024-06-27 18:55:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475333681] [2024-06-27 18:55:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475333681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:52,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:55:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937035529] [2024-06-27 18:55:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:52,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:55:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:55:52,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:55:52,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 1318 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:52,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:52,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:53,806 INFO L124 PetriNetUnfolderBase]: 3648/5772 cut-off events. [2024-06-27 18:55:53,806 INFO L125 PetriNetUnfolderBase]: For 37825/37831 co-relation queries the response was YES. [2024-06-27 18:55:53,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25045 conditions, 5772 events. 3648/5772 cut-off events. For 37825/37831 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 34910 event pairs, 835 based on Foata normal form. 17/5655 useless extension candidates. Maximal degree in co-relation 24988. Up to 4486 conditions per place. [2024-06-27 18:55:53,843 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 147 selfloop transitions, 34 changer transitions 0/190 dead transitions. [2024-06-27 18:55:53,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 190 transitions, 1883 flow [2024-06-27 18:55:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 18:55:53,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380434782608695 [2024-06-27 18:55:53,845 INFO L175 Difference]: Start difference. First operand has 119 places, 137 transitions, 1318 flow. Second operand 8 states and 198 transitions. [2024-06-27 18:55:53,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 190 transitions, 1883 flow [2024-06-27 18:55:53,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 190 transitions, 1833 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-27 18:55:53,889 INFO L231 Difference]: Finished difference. Result has 124 places, 138 transitions, 1367 flow [2024-06-27 18:55:53,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1367, PETRI_PLACES=124, PETRI_TRANSITIONS=138} [2024-06-27 18:55:53,890 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 72 predicate places. [2024-06-27 18:55:53,890 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 138 transitions, 1367 flow [2024-06-27 18:55:53,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:53,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:53,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:55:53,891 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:53,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1640656572, now seen corresponding path program 2 times [2024-06-27 18:55:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396148380] [2024-06-27 18:55:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396148380] [2024-06-27 18:55:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396148380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:54,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:55:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816428226] [2024-06-27 18:55:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:54,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:55:54,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:55:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:55:55,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:55,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 138 transitions, 1367 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:55,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:55,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:55,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:55,956 INFO L124 PetriNetUnfolderBase]: 4040/6154 cut-off events. [2024-06-27 18:55:55,957 INFO L125 PetriNetUnfolderBase]: For 44031/44037 co-relation queries the response was YES. [2024-06-27 18:55:55,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28223 conditions, 6154 events. 4040/6154 cut-off events. For 44031/44037 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36107 event pairs, 845 based on Foata normal form. 13/6114 useless extension candidates. Maximal degree in co-relation 28164. Up to 4783 conditions per place. [2024-06-27 18:55:56,005 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 153 selfloop transitions, 48 changer transitions 0/210 dead transitions. [2024-06-27 18:55:56,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 210 transitions, 2144 flow [2024-06-27 18:55:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-27 18:55:56,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410628019323671 [2024-06-27 18:55:56,006 INFO L175 Difference]: Start difference. First operand has 124 places, 138 transitions, 1367 flow. Second operand 9 states and 224 transitions. [2024-06-27 18:55:56,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 210 transitions, 2144 flow [2024-06-27 18:55:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 210 transitions, 2081 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:56,059 INFO L231 Difference]: Finished difference. Result has 128 places, 143 transitions, 1498 flow [2024-06-27 18:55:56,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1498, PETRI_PLACES=128, PETRI_TRANSITIONS=143} [2024-06-27 18:55:56,059 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 76 predicate places. [2024-06-27 18:55:56,059 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 143 transitions, 1498 flow [2024-06-27 18:55:56,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:56,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:56,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:56,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:55:56,060 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:56,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1640664942, now seen corresponding path program 3 times [2024-06-27 18:55:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:56,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539792334] [2024-06-27 18:55:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539792334] [2024-06-27 18:55:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539792334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:55:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775657610] [2024-06-27 18:55:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:56,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:55:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:55:56,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:55:57,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:57,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 143 transitions, 1498 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:57,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:57,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:57,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:57,960 INFO L124 PetriNetUnfolderBase]: 4040/6154 cut-off events. [2024-06-27 18:55:57,960 INFO L125 PetriNetUnfolderBase]: For 48649/48655 co-relation queries the response was YES. [2024-06-27 18:55:57,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28877 conditions, 6154 events. 4040/6154 cut-off events. For 48649/48655 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36174 event pairs, 965 based on Foata normal form. 17/6118 useless extension candidates. Maximal degree in co-relation 28816. Up to 5402 conditions per place. [2024-06-27 18:55:58,003 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 151 selfloop transitions, 45 changer transitions 0/205 dead transitions. [2024-06-27 18:55:58,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 205 transitions, 2138 flow [2024-06-27 18:55:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 18:55:58,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2024-06-27 18:55:58,005 INFO L175 Difference]: Start difference. First operand has 128 places, 143 transitions, 1498 flow. Second operand 9 states and 219 transitions. [2024-06-27 18:55:58,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 205 transitions, 2138 flow [2024-06-27 18:55:58,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 205 transitions, 2054 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:58,073 INFO L231 Difference]: Finished difference. Result has 132 places, 144 transitions, 1532 flow [2024-06-27 18:55:58,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1532, PETRI_PLACES=132, PETRI_TRANSITIONS=144} [2024-06-27 18:55:58,073 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 80 predicate places. [2024-06-27 18:55:58,074 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 1532 flow [2024-06-27 18:55:58,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:58,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:58,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:58,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:55:58,074 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:58,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1360268610, now seen corresponding path program 1 times [2024-06-27 18:55:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323755367] [2024-06-27 18:55:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323755367] [2024-06-27 18:55:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323755367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:55:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507877351] [2024-06-27 18:55:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:55:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:55:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:55:58,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:55:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 1532 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:58,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:58,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:55:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:59,572 INFO L124 PetriNetUnfolderBase]: 4108/6746 cut-off events. [2024-06-27 18:55:59,572 INFO L125 PetriNetUnfolderBase]: For 49598/49604 co-relation queries the response was YES. [2024-06-27 18:55:59,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29742 conditions, 6746 events. 4108/6746 cut-off events. For 49598/49604 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 43987 event pairs, 1270 based on Foata normal form. 5/6576 useless extension candidates. Maximal degree in co-relation 29679. Up to 5833 conditions per place. [2024-06-27 18:55:59,695 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 129 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-06-27 18:55:59,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 1936 flow [2024-06-27 18:55:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:55:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:55:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-27 18:55:59,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173913043478261 [2024-06-27 18:55:59,696 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 1532 flow. Second operand 5 states and 119 transitions. [2024-06-27 18:55:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 1936 flow [2024-06-27 18:55:59,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 165 transitions, 1845 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 18:55:59,746 INFO L231 Difference]: Finished difference. Result has 130 places, 147 transitions, 1538 flow [2024-06-27 18:55:59,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1538, PETRI_PLACES=130, PETRI_TRANSITIONS=147} [2024-06-27 18:55:59,747 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 78 predicate places. [2024-06-27 18:55:59,747 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 147 transitions, 1538 flow [2024-06-27 18:55:59,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:59,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:59,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:59,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:55:59,748 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:59,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2143259684, now seen corresponding path program 2 times [2024-06-27 18:55:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605306167] [2024-06-27 18:55:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605306167] [2024-06-27 18:56:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605306167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817244455] [2024-06-27 18:56:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:00,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:00,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:00,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:00,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 147 transitions, 1538 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:00,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:00,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:00,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:01,284 INFO L124 PetriNetUnfolderBase]: 4096/6614 cut-off events. [2024-06-27 18:56:01,284 INFO L125 PetriNetUnfolderBase]: For 51860/51866 co-relation queries the response was YES. [2024-06-27 18:56:01,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29969 conditions, 6614 events. 4096/6614 cut-off events. For 51860/51866 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 42237 event pairs, 1264 based on Foata normal form. 5/6474 useless extension candidates. Maximal degree in co-relation 29905. Up to 5761 conditions per place. [2024-06-27 18:56:01,323 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 136 selfloop transitions, 30 changer transitions 0/175 dead transitions. [2024-06-27 18:56:01,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 175 transitions, 2000 flow [2024-06-27 18:56:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 18:56:01,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:56:01,325 INFO L175 Difference]: Start difference. First operand has 130 places, 147 transitions, 1538 flow. Second operand 6 states and 141 transitions. [2024-06-27 18:56:01,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 175 transitions, 2000 flow [2024-06-27 18:56:01,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 175 transitions, 1933 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:01,391 INFO L231 Difference]: Finished difference. Result has 133 places, 150 transitions, 1573 flow [2024-06-27 18:56:01,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1573, PETRI_PLACES=133, PETRI_TRANSITIONS=150} [2024-06-27 18:56:01,391 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2024-06-27 18:56:01,391 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 150 transitions, 1573 flow [2024-06-27 18:56:01,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:01,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:01,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:01,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:56:01,392 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:01,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash 159298503, now seen corresponding path program 1 times [2024-06-27 18:56:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174593243] [2024-06-27 18:56:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174593243] [2024-06-27 18:56:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174593243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740716531] [2024-06-27 18:56:01,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:01,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:01,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:02,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:02,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 150 transitions, 1573 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:02,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:02,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:02,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:02,910 INFO L124 PetriNetUnfolderBase]: 3901/6480 cut-off events. [2024-06-27 18:56:02,910 INFO L125 PetriNetUnfolderBase]: For 53418/53436 co-relation queries the response was YES. [2024-06-27 18:56:02,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29972 conditions, 6480 events. 3901/6480 cut-off events. For 53418/53436 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 42655 event pairs, 1161 based on Foata normal form. 13/6300 useless extension candidates. Maximal degree in co-relation 29907. Up to 5534 conditions per place. [2024-06-27 18:56:02,966 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 152 selfloop transitions, 26 changer transitions 0/190 dead transitions. [2024-06-27 18:56:02,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 190 transitions, 2179 flow [2024-06-27 18:56:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 18:56:02,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531055900621118 [2024-06-27 18:56:02,967 INFO L175 Difference]: Start difference. First operand has 133 places, 150 transitions, 1573 flow. Second operand 7 states and 171 transitions. [2024-06-27 18:56:02,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 190 transitions, 2179 flow [2024-06-27 18:56:03,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 190 transitions, 2103 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:03,042 INFO L231 Difference]: Finished difference. Result has 136 places, 156 transitions, 1645 flow [2024-06-27 18:56:03,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1645, PETRI_PLACES=136, PETRI_TRANSITIONS=156} [2024-06-27 18:56:03,043 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 84 predicate places. [2024-06-27 18:56:03,043 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 156 transitions, 1645 flow [2024-06-27 18:56:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:03,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:03,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:03,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:56:03,043 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:03,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 159418473, now seen corresponding path program 2 times [2024-06-27 18:56:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468045866] [2024-06-27 18:56:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468045866] [2024-06-27 18:56:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468045866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740971062] [2024-06-27 18:56:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:03,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:03,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:03,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 156 transitions, 1645 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:03,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:03,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:03,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:04,634 INFO L124 PetriNetUnfolderBase]: 3995/6623 cut-off events. [2024-06-27 18:56:04,634 INFO L125 PetriNetUnfolderBase]: For 59965/59983 co-relation queries the response was YES. [2024-06-27 18:56:04,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31472 conditions, 6623 events. 3995/6623 cut-off events. For 59965/59983 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43653 event pairs, 1160 based on Foata normal form. 13/6440 useless extension candidates. Maximal degree in co-relation 31406. Up to 5742 conditions per place. [2024-06-27 18:56:04,683 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 156 selfloop transitions, 24 changer transitions 0/192 dead transitions. [2024-06-27 18:56:04,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 192 transitions, 2209 flow [2024-06-27 18:56:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 18:56:04,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515527950310559 [2024-06-27 18:56:04,685 INFO L175 Difference]: Start difference. First operand has 136 places, 156 transitions, 1645 flow. Second operand 7 states and 166 transitions. [2024-06-27 18:56:04,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 192 transitions, 2209 flow [2024-06-27 18:56:04,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 192 transitions, 2148 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:04,757 INFO L231 Difference]: Finished difference. Result has 140 places, 162 transitions, 1728 flow [2024-06-27 18:56:04,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1728, PETRI_PLACES=140, PETRI_TRANSITIONS=162} [2024-06-27 18:56:04,757 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 88 predicate places. [2024-06-27 18:56:04,757 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 162 transitions, 1728 flow [2024-06-27 18:56:04,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:04,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:04,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:04,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:56:04,758 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:04,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 159418659, now seen corresponding path program 1 times [2024-06-27 18:56:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:04,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071619116] [2024-06-27 18:56:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071619116] [2024-06-27 18:56:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071619116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611238125] [2024-06-27 18:56:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:05,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:05,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 162 transitions, 1728 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:05,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:05,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:05,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:06,310 INFO L124 PetriNetUnfolderBase]: 4338/7125 cut-off events. [2024-06-27 18:56:06,310 INFO L125 PetriNetUnfolderBase]: For 63812/63812 co-relation queries the response was YES. [2024-06-27 18:56:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33112 conditions, 7125 events. 4338/7125 cut-off events. For 63812/63812 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 46937 event pairs, 1270 based on Foata normal form. 2/6933 useless extension candidates. Maximal degree in co-relation 33044. Up to 6216 conditions per place. [2024-06-27 18:56:06,354 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 181 selfloop transitions, 23 changer transitions 0/213 dead transitions. [2024-06-27 18:56:06,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 213 transitions, 2468 flow [2024-06-27 18:56:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-06-27 18:56:06,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031055900621118 [2024-06-27 18:56:06,356 INFO L175 Difference]: Start difference. First operand has 140 places, 162 transitions, 1728 flow. Second operand 7 states and 162 transitions. [2024-06-27 18:56:06,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 213 transitions, 2468 flow [2024-06-27 18:56:06,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 213 transitions, 2371 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:06,436 INFO L231 Difference]: Finished difference. Result has 146 places, 181 transitions, 1915 flow [2024-06-27 18:56:06,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1915, PETRI_PLACES=146, PETRI_TRANSITIONS=181} [2024-06-27 18:56:06,436 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 94 predicate places. [2024-06-27 18:56:06,436 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 1915 flow [2024-06-27 18:56:06,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:06,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:06,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:06,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:56:06,437 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:06,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2143253701, now seen corresponding path program 2 times [2024-06-27 18:56:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578742018] [2024-06-27 18:56:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578742018] [2024-06-27 18:56:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578742018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884111031] [2024-06-27 18:56:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:06,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:06,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 1915 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:06,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:06,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:07,851 INFO L124 PetriNetUnfolderBase]: 4372/7052 cut-off events. [2024-06-27 18:56:07,851 INFO L125 PetriNetUnfolderBase]: For 67874/67874 co-relation queries the response was YES. [2024-06-27 18:56:07,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34352 conditions, 7052 events. 4372/7052 cut-off events. For 67874/67874 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 45367 event pairs, 1315 based on Foata normal form. 2/6894 useless extension candidates. Maximal degree in co-relation 34280. Up to 6328 conditions per place. [2024-06-27 18:56:07,906 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 179 selfloop transitions, 15 changer transitions 0/203 dead transitions. [2024-06-27 18:56:07,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 2396 flow [2024-06-27 18:56:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-27 18:56:07,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2024-06-27 18:56:07,908 INFO L175 Difference]: Start difference. First operand has 146 places, 181 transitions, 1915 flow. Second operand 6 states and 133 transitions. [2024-06-27 18:56:07,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 2396 flow [2024-06-27 18:56:07,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 203 transitions, 2374 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 18:56:07,994 INFO L231 Difference]: Finished difference. Result has 151 places, 184 transitions, 1962 flow [2024-06-27 18:56:07,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1962, PETRI_PLACES=151, PETRI_TRANSITIONS=184} [2024-06-27 18:56:07,995 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 99 predicate places. [2024-06-27 18:56:07,995 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 184 transitions, 1962 flow [2024-06-27 18:56:07,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:07,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:07,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:07,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:56:07,996 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:07,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2143519681, now seen corresponding path program 3 times [2024-06-27 18:56:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444310517] [2024-06-27 18:56:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444310517] [2024-06-27 18:56:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444310517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436174726] [2024-06-27 18:56:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:08,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:08,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:08,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 184 transitions, 1962 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:08,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:08,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:08,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:09,428 INFO L124 PetriNetUnfolderBase]: 4366/7156 cut-off events. [2024-06-27 18:56:09,428 INFO L125 PetriNetUnfolderBase]: For 70711/70711 co-relation queries the response was YES. [2024-06-27 18:56:09,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34571 conditions, 7156 events. 4366/7156 cut-off events. For 70711/70711 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 46985 event pairs, 1277 based on Foata normal form. 2/6963 useless extension candidates. Maximal degree in co-relation 34496. Up to 6241 conditions per place. [2024-06-27 18:56:09,490 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 175 selfloop transitions, 27 changer transitions 0/211 dead transitions. [2024-06-27 18:56:09,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 211 transitions, 2474 flow [2024-06-27 18:56:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 18:56:09,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:56:09,491 INFO L175 Difference]: Start difference. First operand has 151 places, 184 transitions, 1962 flow. Second operand 6 states and 141 transitions. [2024-06-27 18:56:09,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 211 transitions, 2474 flow [2024-06-27 18:56:09,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 211 transitions, 2426 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:09,579 INFO L231 Difference]: Finished difference. Result has 155 places, 186 transitions, 2009 flow [2024-06-27 18:56:09,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2009, PETRI_PLACES=155, PETRI_TRANSITIONS=186} [2024-06-27 18:56:09,579 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 103 predicate places. [2024-06-27 18:56:09,579 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 186 transitions, 2009 flow [2024-06-27 18:56:09,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:09,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:09,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:56:09,580 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2143519867, now seen corresponding path program 3 times [2024-06-27 18:56:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984622179] [2024-06-27 18:56:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984622179] [2024-06-27 18:56:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984622179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:10,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:10,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622373729] [2024-06-27 18:56:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:10,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:10,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:10,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 186 transitions, 2009 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:10,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:10,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:11,054 INFO L124 PetriNetUnfolderBase]: 4128/6910 cut-off events. [2024-06-27 18:56:11,054 INFO L125 PetriNetUnfolderBase]: For 71880/71880 co-relation queries the response was YES. [2024-06-27 18:56:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33562 conditions, 6910 events. 4128/6910 cut-off events. For 71880/71880 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 45956 event pairs, 1162 based on Foata normal form. 3/6698 useless extension candidates. Maximal degree in co-relation 33485. Up to 5816 conditions per place. [2024-06-27 18:56:11,127 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 164 selfloop transitions, 30 changer transitions 0/213 dead transitions. [2024-06-27 18:56:11,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 213 transitions, 2499 flow [2024-06-27 18:56:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 18:56:11,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2024-06-27 18:56:11,129 INFO L175 Difference]: Start difference. First operand has 155 places, 186 transitions, 2009 flow. Second operand 6 states and 148 transitions. [2024-06-27 18:56:11,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 213 transitions, 2499 flow [2024-06-27 18:56:11,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 213 transitions, 2428 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:11,257 INFO L231 Difference]: Finished difference. Result has 157 places, 186 transitions, 2010 flow [2024-06-27 18:56:11,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2010, PETRI_PLACES=157, PETRI_TRANSITIONS=186} [2024-06-27 18:56:11,258 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 105 predicate places. [2024-06-27 18:56:11,258 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 186 transitions, 2010 flow [2024-06-27 18:56:11,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:11,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:11,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:11,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:56:11,259 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:11,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2143243812, now seen corresponding path program 1 times [2024-06-27 18:56:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203926308] [2024-06-27 18:56:11,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203926308] [2024-06-27 18:56:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203926308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540119448] [2024-06-27 18:56:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:12,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:12,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:12,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:12,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:12,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 186 transitions, 2010 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:12,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:12,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:12,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:13,014 INFO L124 PetriNetUnfolderBase]: 4352/7016 cut-off events. [2024-06-27 18:56:13,014 INFO L125 PetriNetUnfolderBase]: For 72132/72132 co-relation queries the response was YES. [2024-06-27 18:56:13,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34492 conditions, 7016 events. 4352/7016 cut-off events. For 72132/72132 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 44971 event pairs, 1290 based on Foata normal form. 2/6861 useless extension candidates. Maximal degree in co-relation 34415. Up to 6278 conditions per place. [2024-06-27 18:56:13,076 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 186 selfloop transitions, 17 changer transitions 0/212 dead transitions. [2024-06-27 18:56:13,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 212 transitions, 2526 flow [2024-06-27 18:56:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-27 18:56:13,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2024-06-27 18:56:13,081 INFO L175 Difference]: Start difference. First operand has 157 places, 186 transitions, 2010 flow. Second operand 6 states and 135 transitions. [2024-06-27 18:56:13,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 212 transitions, 2526 flow [2024-06-27 18:56:13,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 212 transitions, 2455 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:13,178 INFO L231 Difference]: Finished difference. Result has 158 places, 188 transitions, 1998 flow [2024-06-27 18:56:13,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1998, PETRI_PLACES=158, PETRI_TRANSITIONS=188} [2024-06-27 18:56:13,179 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 106 predicate places. [2024-06-27 18:56:13,179 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 1998 flow [2024-06-27 18:56:13,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:13,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:13,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:13,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:56:13,179 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:13,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1667881332, now seen corresponding path program 1 times [2024-06-27 18:56:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299093699] [2024-06-27 18:56:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299093699] [2024-06-27 18:56:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299093699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:56:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229555488] [2024-06-27 18:56:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:14,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:56:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:56:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:56:14,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:14,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 188 transitions, 1998 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:14,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:14,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:14,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:15,313 INFO L124 PetriNetUnfolderBase]: 4445/7248 cut-off events. [2024-06-27 18:56:15,313 INFO L125 PetriNetUnfolderBase]: For 78921/78927 co-relation queries the response was YES. [2024-06-27 18:56:15,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35498 conditions, 7248 events. 4445/7248 cut-off events. For 78921/78927 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 47068 event pairs, 973 based on Foata normal form. 13/7077 useless extension candidates. Maximal degree in co-relation 35420. Up to 6195 conditions per place. [2024-06-27 18:56:15,376 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 207 selfloop transitions, 19 changer transitions 0/235 dead transitions. [2024-06-27 18:56:15,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 235 transitions, 2614 flow [2024-06-27 18:56:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 18:56:15,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-27 18:56:15,377 INFO L175 Difference]: Start difference. First operand has 158 places, 188 transitions, 1998 flow. Second operand 8 states and 187 transitions. [2024-06-27 18:56:15,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 235 transitions, 2614 flow [2024-06-27 18:56:15,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 235 transitions, 2569 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:15,491 INFO L231 Difference]: Finished difference. Result has 162 places, 189 transitions, 2019 flow [2024-06-27 18:56:15,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2019, PETRI_PLACES=162, PETRI_TRANSITIONS=189} [2024-06-27 18:56:15,491 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 110 predicate places. [2024-06-27 18:56:15,491 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 189 transitions, 2019 flow [2024-06-27 18:56:15,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:15,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:15,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:56:15,492 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:15,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2023133026, now seen corresponding path program 2 times [2024-06-27 18:56:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457918949] [2024-06-27 18:56:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457918949] [2024-06-27 18:56:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457918949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:56:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590733659] [2024-06-27 18:56:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:16,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:56:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:56:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:56:16,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:16,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 189 transitions, 2019 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:16,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:16,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:16,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:17,874 INFO L124 PetriNetUnfolderBase]: 4445/7187 cut-off events. [2024-06-27 18:56:17,874 INFO L125 PetriNetUnfolderBase]: For 79980/79986 co-relation queries the response was YES. [2024-06-27 18:56:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35478 conditions, 7187 events. 4445/7187 cut-off events. For 79980/79986 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 46265 event pairs, 1104 based on Foata normal form. 13/7004 useless extension candidates. Maximal degree in co-relation 35399. Up to 6004 conditions per place. [2024-06-27 18:56:17,930 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 200 selfloop transitions, 30 changer transitions 0/239 dead transitions. [2024-06-27 18:56:17,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 239 transitions, 2648 flow [2024-06-27 18:56:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 18:56:17,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190217391304348 [2024-06-27 18:56:17,931 INFO L175 Difference]: Start difference. First operand has 162 places, 189 transitions, 2019 flow. Second operand 8 states and 191 transitions. [2024-06-27 18:56:17,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 239 transitions, 2648 flow [2024-06-27 18:56:18,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 239 transitions, 2598 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:18,031 INFO L231 Difference]: Finished difference. Result has 163 places, 189 transitions, 2019 flow [2024-06-27 18:56:18,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2019, PETRI_PLACES=163, PETRI_TRANSITIONS=189} [2024-06-27 18:56:18,032 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 111 predicate places. [2024-06-27 18:56:18,032 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 189 transitions, 2019 flow [2024-06-27 18:56:18,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:18,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:18,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:56:18,032 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:18,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 643197545, now seen corresponding path program 1 times [2024-06-27 18:56:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768878484] [2024-06-27 18:56:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768878484] [2024-06-27 18:56:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768878484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463692857] [2024-06-27 18:56:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:18,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:18,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:18,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:18,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:18,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 189 transitions, 2019 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:18,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:18,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:18,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:19,880 INFO L124 PetriNetUnfolderBase]: 4269/6867 cut-off events. [2024-06-27 18:56:19,881 INFO L125 PetriNetUnfolderBase]: For 81151/81151 co-relation queries the response was YES. [2024-06-27 18:56:19,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34459 conditions, 6867 events. 4269/6867 cut-off events. For 81151/81151 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 43603 event pairs, 1092 based on Foata normal form. 2/6743 useless extension candidates. Maximal degree in co-relation 34379. Up to 5841 conditions per place. [2024-06-27 18:56:19,939 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 194 selfloop transitions, 54 changer transitions 0/268 dead transitions. [2024-06-27 18:56:19,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 268 transitions, 3148 flow [2024-06-27 18:56:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 18:56:19,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244565217391305 [2024-06-27 18:56:19,942 INFO L175 Difference]: Start difference. First operand has 163 places, 189 transitions, 2019 flow. Second operand 8 states and 193 transitions. [2024-06-27 18:56:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 268 transitions, 3148 flow [2024-06-27 18:56:20,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 268 transitions, 3068 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:20,069 INFO L231 Difference]: Finished difference. Result has 169 places, 223 transitions, 2567 flow [2024-06-27 18:56:20,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2567, PETRI_PLACES=169, PETRI_TRANSITIONS=223} [2024-06-27 18:56:20,070 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 117 predicate places. [2024-06-27 18:56:20,070 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 223 transitions, 2567 flow [2024-06-27 18:56:20,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:20,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:20,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:20,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:56:20,071 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:20,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -617835096, now seen corresponding path program 1 times [2024-06-27 18:56:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808381149] [2024-06-27 18:56:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808381149] [2024-06-27 18:56:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808381149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:20,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:20,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122381748] [2024-06-27 18:56:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:20,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:20,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:20,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 223 transitions, 2567 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:20,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:20,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:20,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:21,876 INFO L124 PetriNetUnfolderBase]: 4538/7506 cut-off events. [2024-06-27 18:56:21,877 INFO L125 PetriNetUnfolderBase]: For 90454/90454 co-relation queries the response was YES. [2024-06-27 18:56:21,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37750 conditions, 7506 events. 4538/7506 cut-off events. For 90454/90454 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50038 event pairs, 1291 based on Foata normal form. 2/7294 useless extension candidates. Maximal degree in co-relation 37665. Up to 6356 conditions per place. [2024-06-27 18:56:21,951 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 231 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2024-06-27 18:56:21,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 278 transitions, 3478 flow [2024-06-27 18:56:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 18:56:21,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-27 18:56:21,953 INFO L175 Difference]: Start difference. First operand has 169 places, 223 transitions, 2567 flow. Second operand 8 states and 187 transitions. [2024-06-27 18:56:21,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 278 transitions, 3478 flow [2024-06-27 18:56:22,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 278 transitions, 3410 flow, removed 33 selfloop flow, removed 1 redundant places. [2024-06-27 18:56:22,127 INFO L231 Difference]: Finished difference. Result has 178 places, 236 transitions, 2773 flow [2024-06-27 18:56:22,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2773, PETRI_PLACES=178, PETRI_TRANSITIONS=236} [2024-06-27 18:56:22,128 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 126 predicate places. [2024-06-27 18:56:22,128 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 236 transitions, 2773 flow [2024-06-27 18:56:22,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:22,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:22,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:22,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:56:22,129 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:22,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -617835251, now seen corresponding path program 2 times [2024-06-27 18:56:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993006180] [2024-06-27 18:56:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993006180] [2024-06-27 18:56:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993006180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985861480] [2024-06-27 18:56:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:22,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:22,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:22,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 236 transitions, 2773 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:22,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:22,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:22,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:23,940 INFO L124 PetriNetUnfolderBase]: 4398/7050 cut-off events. [2024-06-27 18:56:23,940 INFO L125 PetriNetUnfolderBase]: For 93486/93486 co-relation queries the response was YES. [2024-06-27 18:56:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37283 conditions, 7050 events. 4398/7050 cut-off events. For 93486/93486 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 44697 event pairs, 1094 based on Foata normal form. 2/6925 useless extension candidates. Maximal degree in co-relation 37193. Up to 6039 conditions per place. [2024-06-27 18:56:24,016 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 204 selfloop transitions, 56 changer transitions 0/283 dead transitions. [2024-06-27 18:56:24,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 283 transitions, 3546 flow [2024-06-27 18:56:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 18:56:24,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:56:24,018 INFO L175 Difference]: Start difference. First operand has 178 places, 236 transitions, 2773 flow. Second operand 8 states and 188 transitions. [2024-06-27 18:56:24,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 283 transitions, 3546 flow [2024-06-27 18:56:24,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 283 transitions, 3477 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:24,187 INFO L231 Difference]: Finished difference. Result has 184 places, 244 transitions, 2953 flow [2024-06-27 18:56:24,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=184, PETRI_TRANSITIONS=244} [2024-06-27 18:56:24,187 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 132 predicate places. [2024-06-27 18:56:24,188 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 244 transitions, 2953 flow [2024-06-27 18:56:24,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:24,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:24,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:24,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:56:24,188 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:24,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 647012560, now seen corresponding path program 2 times [2024-06-27 18:56:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495131019] [2024-06-27 18:56:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495131019] [2024-06-27 18:56:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495131019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156678331] [2024-06-27 18:56:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:24,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:24,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:24,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:24,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 244 transitions, 2953 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:24,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:24,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:26,135 INFO L124 PetriNetUnfolderBase]: 4656/7532 cut-off events. [2024-06-27 18:56:26,136 INFO L125 PetriNetUnfolderBase]: For 101480/101480 co-relation queries the response was YES. [2024-06-27 18:56:26,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39884 conditions, 7532 events. 4656/7532 cut-off events. For 101480/101480 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 49102 event pairs, 1291 based on Foata normal form. 2/7352 useless extension candidates. Maximal degree in co-relation 39791. Up to 6591 conditions per place. [2024-06-27 18:56:26,218 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 255 selfloop transitions, 36 changer transitions 0/300 dead transitions. [2024-06-27 18:56:26,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 300 transitions, 3867 flow [2024-06-27 18:56:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:56:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:56:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-27 18:56:26,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2024-06-27 18:56:26,219 INFO L175 Difference]: Start difference. First operand has 184 places, 244 transitions, 2953 flow. Second operand 10 states and 223 transitions. [2024-06-27 18:56:26,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 300 transitions, 3867 flow [2024-06-27 18:56:26,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 300 transitions, 3733 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:26,394 INFO L231 Difference]: Finished difference. Result has 190 places, 252 transitions, 3001 flow [2024-06-27 18:56:26,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3001, PETRI_PLACES=190, PETRI_TRANSITIONS=252} [2024-06-27 18:56:26,394 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 138 predicate places. [2024-06-27 18:56:26,394 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 252 transitions, 3001 flow [2024-06-27 18:56:26,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:26,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:26,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:56:26,395 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:26,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -614116181, now seen corresponding path program 3 times [2024-06-27 18:56:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:26,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740381720] [2024-06-27 18:56:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740381720] [2024-06-27 18:56:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740381720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658983247] [2024-06-27 18:56:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:27,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:27,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:27,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:27,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 252 transitions, 3001 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:27,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:27,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:27,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:28,498 INFO L124 PetriNetUnfolderBase]: 4538/7311 cut-off events. [2024-06-27 18:56:28,498 INFO L125 PetriNetUnfolderBase]: For 104433/104433 co-relation queries the response was YES. [2024-06-27 18:56:28,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39127 conditions, 7311 events. 4538/7311 cut-off events. For 104433/104433 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 47273 event pairs, 1175 based on Foata normal form. 4/7134 useless extension candidates. Maximal degree in co-relation 39032. Up to 6198 conditions per place. [2024-06-27 18:56:28,581 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 209 selfloop transitions, 64 changer transitions 0/299 dead transitions. [2024-06-27 18:56:28,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 299 transitions, 3852 flow [2024-06-27 18:56:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 18:56:28,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135869565217391 [2024-06-27 18:56:28,585 INFO L175 Difference]: Start difference. First operand has 190 places, 252 transitions, 3001 flow. Second operand 8 states and 189 transitions. [2024-06-27 18:56:28,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 299 transitions, 3852 flow [2024-06-27 18:56:28,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 299 transitions, 3787 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:28,788 INFO L231 Difference]: Finished difference. Result has 194 places, 264 transitions, 3275 flow [2024-06-27 18:56:28,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3275, PETRI_PLACES=194, PETRI_TRANSITIONS=264} [2024-06-27 18:56:28,788 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 142 predicate places. [2024-06-27 18:56:28,789 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 264 transitions, 3275 flow [2024-06-27 18:56:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:28,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:28,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:56:28,789 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:28,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -614116026, now seen corresponding path program 3 times [2024-06-27 18:56:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973825311] [2024-06-27 18:56:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973825311] [2024-06-27 18:56:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973825311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:29,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974794354] [2024-06-27 18:56:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:29,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:29,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:29,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 264 transitions, 3275 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:29,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:29,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:29,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:30,762 INFO L124 PetriNetUnfolderBase]: 4735/7654 cut-off events. [2024-06-27 18:56:30,762 INFO L125 PetriNetUnfolderBase]: For 118654/118654 co-relation queries the response was YES. [2024-06-27 18:56:30,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42037 conditions, 7654 events. 4735/7654 cut-off events. For 118654/118654 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 49933 event pairs, 1298 based on Foata normal form. 2/7470 useless extension candidates. Maximal degree in co-relation 41939. Up to 6701 conditions per place. [2024-06-27 18:56:30,829 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 257 selfloop transitions, 35 changer transitions 0/301 dead transitions. [2024-06-27 18:56:30,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 301 transitions, 3999 flow [2024-06-27 18:56:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 18:56:30,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:56:30,830 INFO L175 Difference]: Start difference. First operand has 194 places, 264 transitions, 3275 flow. Second operand 8 states and 184 transitions. [2024-06-27 18:56:30,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 301 transitions, 3999 flow [2024-06-27 18:56:31,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 301 transitions, 3821 flow, removed 58 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:31,048 INFO L231 Difference]: Finished difference. Result has 198 places, 264 transitions, 3173 flow [2024-06-27 18:56:31,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3173, PETRI_PLACES=198, PETRI_TRANSITIONS=264} [2024-06-27 18:56:31,048 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 146 predicate places. [2024-06-27 18:56:31,048 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 264 transitions, 3173 flow [2024-06-27 18:56:31,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:31,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:31,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:31,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:56:31,049 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:31,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1232403497, now seen corresponding path program 4 times [2024-06-27 18:56:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:31,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536832810] [2024-06-27 18:56:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:31,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536832810] [2024-06-27 18:56:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536832810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623936433] [2024-06-27 18:56:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:31,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:56:31,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 264 transitions, 3173 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:31,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:31,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:56:31,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:33,152 INFO L124 PetriNetUnfolderBase]: 4556/7383 cut-off events. [2024-06-27 18:56:33,152 INFO L125 PetriNetUnfolderBase]: For 114854/114854 co-relation queries the response was YES. [2024-06-27 18:56:33,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40523 conditions, 7383 events. 4556/7383 cut-off events. For 114854/114854 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 48074 event pairs, 1149 based on Foata normal form. 4/7197 useless extension candidates. Maximal degree in co-relation 40424. Up to 6145 conditions per place. [2024-06-27 18:56:33,217 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 210 selfloop transitions, 72 changer transitions 0/308 dead transitions. [2024-06-27 18:56:33,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 308 transitions, 4017 flow [2024-06-27 18:56:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 18:56:33,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-06-27 18:56:33,219 INFO L175 Difference]: Start difference. First operand has 198 places, 264 transitions, 3173 flow. Second operand 7 states and 175 transitions. [2024-06-27 18:56:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 308 transitions, 4017 flow [2024-06-27 18:56:33,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 308 transitions, 3923 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:56:33,454 INFO L231 Difference]: Finished difference. Result has 199 places, 273 transitions, 3448 flow [2024-06-27 18:56:33,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3448, PETRI_PLACES=199, PETRI_TRANSITIONS=273} [2024-06-27 18:56:33,455 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 147 predicate places. [2024-06-27 18:56:33,455 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 273 transitions, 3448 flow [2024-06-27 18:56:33,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:33,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:33,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:33,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:56:33,456 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:33,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2024604824, now seen corresponding path program 4 times [2024-06-27 18:56:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208296293] [2024-06-27 18:56:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208296293] [2024-06-27 18:56:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208296293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412811044] [2024-06-27 18:56:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:34,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:34,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:34,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 273 transitions, 3448 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:34,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:34,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:34,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:35,360 INFO L124 PetriNetUnfolderBase]: 4807/7932 cut-off events. [2024-06-27 18:56:35,360 INFO L125 PetriNetUnfolderBase]: For 133156/133156 co-relation queries the response was YES. [2024-06-27 18:56:35,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44197 conditions, 7932 events. 4807/7932 cut-off events. For 133156/133156 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 53220 event pairs, 1313 based on Foata normal form. 2/7701 useless extension candidates. Maximal degree in co-relation 44096. Up to 6800 conditions per place. [2024-06-27 18:56:35,448 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 272 selfloop transitions, 31 changer transitions 0/312 dead transitions. [2024-06-27 18:56:35,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 312 transitions, 4303 flow [2024-06-27 18:56:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 18:56:35,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186335403726708 [2024-06-27 18:56:35,449 INFO L175 Difference]: Start difference. First operand has 199 places, 273 transitions, 3448 flow. Second operand 7 states and 167 transitions. [2024-06-27 18:56:35,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 312 transitions, 4303 flow [2024-06-27 18:56:35,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 312 transitions, 4162 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:35,716 INFO L231 Difference]: Finished difference. Result has 203 places, 277 transitions, 3445 flow [2024-06-27 18:56:35,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3445, PETRI_PLACES=203, PETRI_TRANSITIONS=277} [2024-06-27 18:56:35,717 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 151 predicate places. [2024-06-27 18:56:35,717 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 277 transitions, 3445 flow [2024-06-27 18:56:35,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:35,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:35,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:35,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:56:35,717 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:35,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2016057907, now seen corresponding path program 1 times [2024-06-27 18:56:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:35,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214255812] [2024-06-27 18:56:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214255812] [2024-06-27 18:56:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214255812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698893506] [2024-06-27 18:56:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:36,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:36,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:36,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:36,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:36,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 277 transitions, 3445 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:36,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:36,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:36,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:37,830 INFO L124 PetriNetUnfolderBase]: 4814/7703 cut-off events. [2024-06-27 18:56:37,831 INFO L125 PetriNetUnfolderBase]: For 130825/130825 co-relation queries the response was YES. [2024-06-27 18:56:37,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43963 conditions, 7703 events. 4814/7703 cut-off events. For 130825/130825 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 49673 event pairs, 1335 based on Foata normal form. 1/7539 useless extension candidates. Maximal degree in co-relation 43860. Up to 6912 conditions per place. [2024-06-27 18:56:37,916 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 274 selfloop transitions, 21 changer transitions 0/304 dead transitions. [2024-06-27 18:56:37,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 304 transitions, 4161 flow [2024-06-27 18:56:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-27 18:56:37,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2024-06-27 18:56:37,917 INFO L175 Difference]: Start difference. First operand has 203 places, 277 transitions, 3445 flow. Second operand 6 states and 135 transitions. [2024-06-27 18:56:37,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 304 transitions, 4161 flow [2024-06-27 18:56:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 304 transitions, 4030 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:38,186 INFO L231 Difference]: Finished difference. Result has 203 places, 280 transitions, 3402 flow [2024-06-27 18:56:38,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3402, PETRI_PLACES=203, PETRI_TRANSITIONS=280} [2024-06-27 18:56:38,187 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 151 predicate places. [2024-06-27 18:56:38,187 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 280 transitions, 3402 flow [2024-06-27 18:56:38,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:38,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:38,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:38,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:56:38,188 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:38,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2016353864, now seen corresponding path program 5 times [2024-06-27 18:56:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665399832] [2024-06-27 18:56:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665399832] [2024-06-27 18:56:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665399832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:38,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:38,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029750267] [2024-06-27 18:56:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:38,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:38,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:38,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 280 transitions, 3402 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:38,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:38,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:38,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:40,018 INFO L124 PetriNetUnfolderBase]: 4848/7748 cut-off events. [2024-06-27 18:56:40,018 INFO L125 PetriNetUnfolderBase]: For 135712/135712 co-relation queries the response was YES. [2024-06-27 18:56:40,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44444 conditions, 7748 events. 4848/7748 cut-off events. For 135712/135712 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 49951 event pairs, 1370 based on Foata normal form. 2/7584 useless extension candidates. Maximal degree in co-relation 44341. Up to 6967 conditions per place. [2024-06-27 18:56:40,100 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 281 selfloop transitions, 18 changer transitions 0/308 dead transitions. [2024-06-27 18:56:40,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 308 transitions, 4130 flow [2024-06-27 18:56:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-06-27 18:56:40,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751552795031056 [2024-06-27 18:56:40,101 INFO L175 Difference]: Start difference. First operand has 203 places, 280 transitions, 3402 flow. Second operand 7 states and 153 transitions. [2024-06-27 18:56:40,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 308 transitions, 4130 flow [2024-06-27 18:56:40,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 308 transitions, 4082 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:40,369 INFO L231 Difference]: Finished difference. Result has 206 places, 283 transitions, 3442 flow [2024-06-27 18:56:40,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3442, PETRI_PLACES=206, PETRI_TRANSITIONS=283} [2024-06-27 18:56:40,370 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 154 predicate places. [2024-06-27 18:56:40,370 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 283 transitions, 3442 flow [2024-06-27 18:56:40,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:40,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:40,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:40,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:56:40,371 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:40,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2024599244, now seen corresponding path program 6 times [2024-06-27 18:56:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479343608] [2024-06-27 18:56:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479343608] [2024-06-27 18:56:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479343608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821015645] [2024-06-27 18:56:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:40,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:41,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:41,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 283 transitions, 3442 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:41,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:41,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:41,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:42,288 INFO L124 PetriNetUnfolderBase]: 4842/7974 cut-off events. [2024-06-27 18:56:42,289 INFO L125 PetriNetUnfolderBase]: For 139474/139474 co-relation queries the response was YES. [2024-06-27 18:56:42,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44700 conditions, 7974 events. 4842/7974 cut-off events. For 139474/139474 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 53378 event pairs, 1318 based on Foata normal form. 2/7747 useless extension candidates. Maximal degree in co-relation 44596. Up to 6835 conditions per place. [2024-06-27 18:56:42,514 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 273 selfloop transitions, 33 changer transitions 0/315 dead transitions. [2024-06-27 18:56:42,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 315 transitions, 4180 flow [2024-06-27 18:56:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-27 18:56:42,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062111801242236 [2024-06-27 18:56:42,515 INFO L175 Difference]: Start difference. First operand has 206 places, 283 transitions, 3442 flow. Second operand 7 states and 163 transitions. [2024-06-27 18:56:42,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 315 transitions, 4180 flow [2024-06-27 18:56:42,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 315 transitions, 4112 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:42,772 INFO L231 Difference]: Finished difference. Result has 208 places, 284 transitions, 3456 flow [2024-06-27 18:56:42,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3376, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3456, PETRI_PLACES=208, PETRI_TRANSITIONS=284} [2024-06-27 18:56:42,773 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 156 predicate places. [2024-06-27 18:56:42,773 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 284 transitions, 3456 flow [2024-06-27 18:56:42,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:42,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:42,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:42,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:56:42,774 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:42,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1553071582, now seen corresponding path program 1 times [2024-06-27 18:56:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530606786] [2024-06-27 18:56:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:43,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530606786] [2024-06-27 18:56:43,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530606786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222677543] [2024-06-27 18:56:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:43,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:43,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:43,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 284 transitions, 3456 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:43,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:43,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:43,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:44,737 INFO L124 PetriNetUnfolderBase]: 5104/8110 cut-off events. [2024-06-27 18:56:44,737 INFO L125 PetriNetUnfolderBase]: For 151344/151353 co-relation queries the response was YES. [2024-06-27 18:56:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47454 conditions, 8110 events. 5104/8110 cut-off events. For 151344/151353 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 52205 event pairs, 1249 based on Foata normal form. 10/7934 useless extension candidates. Maximal degree in co-relation 47349. Up to 7023 conditions per place. [2024-06-27 18:56:44,838 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 280 selfloop transitions, 56 changer transitions 0/345 dead transitions. [2024-06-27 18:56:44,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 345 transitions, 4741 flow [2024-06-27 18:56:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 18:56:44,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-27 18:56:44,840 INFO L175 Difference]: Start difference. First operand has 208 places, 284 transitions, 3456 flow. Second operand 8 states and 187 transitions. [2024-06-27 18:56:44,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 345 transitions, 4741 flow [2024-06-27 18:56:45,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 345 transitions, 4687 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:45,187 INFO L231 Difference]: Finished difference. Result has 216 places, 306 transitions, 3965 flow [2024-06-27 18:56:45,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3965, PETRI_PLACES=216, PETRI_TRANSITIONS=306} [2024-06-27 18:56:45,188 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 164 predicate places. [2024-06-27 18:56:45,188 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 306 transitions, 3965 flow [2024-06-27 18:56:45,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:45,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:45,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:45,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:56:45,189 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:45,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1106793314, now seen corresponding path program 2 times [2024-06-27 18:56:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748888144] [2024-06-27 18:56:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748888144] [2024-06-27 18:56:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748888144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102846978] [2024-06-27 18:56:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:45,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:45,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:45,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 306 transitions, 3965 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:45,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:45,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:45,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:47,212 INFO L124 PetriNetUnfolderBase]: 5172/8210 cut-off events. [2024-06-27 18:56:47,212 INFO L125 PetriNetUnfolderBase]: For 166039/166048 co-relation queries the response was YES. [2024-06-27 18:56:47,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50247 conditions, 8210 events. 5172/8210 cut-off events. For 166039/166048 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 52868 event pairs, 1262 based on Foata normal form. 10/8033 useless extension candidates. Maximal degree in co-relation 50138. Up to 7071 conditions per place. [2024-06-27 18:56:47,311 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 273 selfloop transitions, 60 changer transitions 0/342 dead transitions. [2024-06-27 18:56:47,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 342 transitions, 4928 flow [2024-06-27 18:56:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-27 18:56:47,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124223602484472 [2024-06-27 18:56:47,312 INFO L175 Difference]: Start difference. First operand has 216 places, 306 transitions, 3965 flow. Second operand 7 states and 165 transitions. [2024-06-27 18:56:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 342 transitions, 4928 flow [2024-06-27 18:56:47,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 342 transitions, 4845 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-27 18:56:47,713 INFO L231 Difference]: Finished difference. Result has 222 places, 311 transitions, 4144 flow [2024-06-27 18:56:47,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3882, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4144, PETRI_PLACES=222, PETRI_TRANSITIONS=311} [2024-06-27 18:56:47,714 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 170 predicate places. [2024-06-27 18:56:47,714 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 311 transitions, 4144 flow [2024-06-27 18:56:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:47,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:47,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:56:47,715 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:47,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1106527334, now seen corresponding path program 3 times [2024-06-27 18:56:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:47,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107242591] [2024-06-27 18:56:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107242591] [2024-06-27 18:56:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107242591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:48,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:48,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973930425] [2024-06-27 18:56:48,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:48,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:48,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:48,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 311 transitions, 4144 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:48,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:48,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:49,733 INFO L124 PetriNetUnfolderBase]: 5160/8249 cut-off events. [2024-06-27 18:56:49,733 INFO L125 PetriNetUnfolderBase]: For 170540/170549 co-relation queries the response was YES. [2024-06-27 18:56:49,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50664 conditions, 8249 events. 5160/8249 cut-off events. For 170540/170549 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53637 event pairs, 1428 based on Foata normal form. 10/8078 useless extension candidates. Maximal degree in co-relation 50552. Up to 7334 conditions per place. [2024-06-27 18:56:49,822 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 293 selfloop transitions, 28 changer transitions 0/330 dead transitions. [2024-06-27 18:56:49,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 330 transitions, 4858 flow [2024-06-27 18:56:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 18:56:49,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2024-06-27 18:56:49,823 INFO L175 Difference]: Start difference. First operand has 222 places, 311 transitions, 4144 flow. Second operand 6 states and 136 transitions. [2024-06-27 18:56:49,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 330 transitions, 4858 flow [2024-06-27 18:56:50,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 330 transitions, 4713 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:50,145 INFO L231 Difference]: Finished difference. Result has 222 places, 311 transitions, 4065 flow [2024-06-27 18:56:50,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4065, PETRI_PLACES=222, PETRI_TRANSITIONS=311} [2024-06-27 18:56:50,145 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 170 predicate places. [2024-06-27 18:56:50,145 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 311 transitions, 4065 flow [2024-06-27 18:56:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:50,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:50,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:50,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:56:50,146 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:50,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1106517445, now seen corresponding path program 1 times [2024-06-27 18:56:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126943940] [2024-06-27 18:56:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126943940] [2024-06-27 18:56:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126943940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:51,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:56:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71716812] [2024-06-27 18:56:51,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:56:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:56:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:56:51,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:51,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 311 transitions, 4065 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:51,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:51,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:51,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:52,768 INFO L124 PetriNetUnfolderBase]: 5316/8463 cut-off events. [2024-06-27 18:56:52,768 INFO L125 PetriNetUnfolderBase]: For 172179/172185 co-relation queries the response was YES. [2024-06-27 18:56:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51049 conditions, 8463 events. 5316/8463 cut-off events. For 172179/172185 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 54970 event pairs, 1432 based on Foata normal form. 13/8294 useless extension candidates. Maximal degree in co-relation 50938. Up to 7308 conditions per place. [2024-06-27 18:56:52,856 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 295 selfloop transitions, 36 changer transitions 0/340 dead transitions. [2024-06-27 18:56:52,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 340 transitions, 4893 flow [2024-06-27 18:56:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-27 18:56:52,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181159420289855 [2024-06-27 18:56:52,858 INFO L175 Difference]: Start difference. First operand has 222 places, 311 transitions, 4065 flow. Second operand 6 states and 143 transitions. [2024-06-27 18:56:52,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 340 transitions, 4893 flow [2024-06-27 18:56:53,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 340 transitions, 4844 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:53,145 INFO L231 Difference]: Finished difference. Result has 225 places, 312 transitions, 4110 flow [2024-06-27 18:56:53,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4016, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4110, PETRI_PLACES=225, PETRI_TRANSITIONS=312} [2024-06-27 18:56:53,146 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 173 predicate places. [2024-06-27 18:56:53,146 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 312 transitions, 4110 flow [2024-06-27 18:56:53,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:53,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:53,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:53,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:56:53,147 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:53,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash 653811562, now seen corresponding path program 4 times [2024-06-27 18:56:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404551967] [2024-06-27 18:56:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404551967] [2024-06-27 18:56:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404551967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946206718] [2024-06-27 18:56:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:53,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:53,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 312 transitions, 4110 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:53,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:55,363 INFO L124 PetriNetUnfolderBase]: 5498/8746 cut-off events. [2024-06-27 18:56:55,363 INFO L125 PetriNetUnfolderBase]: For 178578/178587 co-relation queries the response was YES. [2024-06-27 18:56:55,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53350 conditions, 8746 events. 5498/8746 cut-off events. For 178578/178587 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 57062 event pairs, 1344 based on Foata normal form. 10/8549 useless extension candidates. Maximal degree in co-relation 53237. Up to 7537 conditions per place. [2024-06-27 18:56:55,471 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 303 selfloop transitions, 59 changer transitions 0/371 dead transitions. [2024-06-27 18:56:55,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 371 transitions, 5313 flow [2024-06-27 18:56:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:56:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:56:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-06-27 18:56:55,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-06-27 18:56:55,475 INFO L175 Difference]: Start difference. First operand has 225 places, 312 transitions, 4110 flow. Second operand 9 states and 210 transitions. [2024-06-27 18:56:55,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 371 transitions, 5313 flow [2024-06-27 18:56:55,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 371 transitions, 5245 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:55,811 INFO L231 Difference]: Finished difference. Result has 230 places, 323 transitions, 4353 flow [2024-06-27 18:56:55,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4042, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4353, PETRI_PLACES=230, PETRI_TRANSITIONS=323} [2024-06-27 18:56:55,812 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 178 predicate places. [2024-06-27 18:56:55,812 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 323 transitions, 4353 flow [2024-06-27 18:56:55,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:55,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:55,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:55,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:56:55,813 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:55,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1857562112, now seen corresponding path program 5 times [2024-06-27 18:56:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9563872] [2024-06-27 18:56:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9563872] [2024-06-27 18:56:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9563872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:56,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838642667] [2024-06-27 18:56:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:56,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:56,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 323 transitions, 4353 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:56,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:56,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:56,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:57,928 INFO L124 PetriNetUnfolderBase]: 5711/9066 cut-off events. [2024-06-27 18:56:57,928 INFO L125 PetriNetUnfolderBase]: For 200042/200051 co-relation queries the response was YES. [2024-06-27 18:56:58,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56811 conditions, 9066 events. 5711/9066 cut-off events. For 200042/200051 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 59323 event pairs, 1351 based on Foata normal form. 10/8874 useless extension candidates. Maximal degree in co-relation 56697. Up to 7392 conditions per place. [2024-06-27 18:56:58,042 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 281 selfloop transitions, 88 changer transitions 0/378 dead transitions. [2024-06-27 18:56:58,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 378 transitions, 5671 flow [2024-06-27 18:56:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 18:56:58,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190217391304348 [2024-06-27 18:56:58,044 INFO L175 Difference]: Start difference. First operand has 230 places, 323 transitions, 4353 flow. Second operand 8 states and 191 transitions. [2024-06-27 18:56:58,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 378 transitions, 5671 flow [2024-06-27 18:56:58,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 378 transitions, 5423 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:58,502 INFO L231 Difference]: Finished difference. Result has 233 places, 336 transitions, 4537 flow [2024-06-27 18:56:58,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4127, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4537, PETRI_PLACES=233, PETRI_TRANSITIONS=336} [2024-06-27 18:56:58,502 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 181 predicate places. [2024-06-27 18:56:58,502 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 336 transitions, 4537 flow [2024-06-27 18:56:58,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:58,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:58,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:56:58,503 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:58,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1880787364, now seen corresponding path program 6 times [2024-06-27 18:56:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084375682] [2024-06-27 18:56:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:56:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084375682] [2024-06-27 18:56:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084375682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:56:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315836] [2024-06-27 18:56:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:56:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:56:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:56:59,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:56:59,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 336 transitions, 4537 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:59,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:59,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:56:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:00,803 INFO L124 PetriNetUnfolderBase]: 5699/9110 cut-off events. [2024-06-27 18:57:00,803 INFO L125 PetriNetUnfolderBase]: For 208441/208450 co-relation queries the response was YES. [2024-06-27 18:57:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57842 conditions, 9110 events. 5699/9110 cut-off events. For 208441/208450 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 60331 event pairs, 1384 based on Foata normal form. 10/8897 useless extension candidates. Maximal degree in co-relation 57728. Up to 7885 conditions per place. [2024-06-27 18:57:00,917 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 307 selfloop transitions, 57 changer transitions 0/373 dead transitions. [2024-06-27 18:57:00,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 373 transitions, 5444 flow [2024-06-27 18:57:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:57:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:57:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 18:57:00,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:57:00,918 INFO L175 Difference]: Start difference. First operand has 233 places, 336 transitions, 4537 flow. Second operand 8 states and 184 transitions. [2024-06-27 18:57:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 373 transitions, 5444 flow [2024-06-27 18:57:01,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 373 transitions, 5318 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 18:57:01,392 INFO L231 Difference]: Finished difference. Result has 238 places, 336 transitions, 4532 flow [2024-06-27 18:57:01,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4411, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4532, PETRI_PLACES=238, PETRI_TRANSITIONS=336} [2024-06-27 18:57:01,393 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 186 predicate places. [2024-06-27 18:57:01,393 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 336 transitions, 4532 flow [2024-06-27 18:57:01,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:01,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:01,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:01,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:57:01,394 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:01,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1661479936, now seen corresponding path program 7 times [2024-06-27 18:57:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:01,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422629333] [2024-06-27 18:57:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:02,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422629333] [2024-06-27 18:57:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422629333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:02,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:02,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745016782] [2024-06-27 18:57:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:02,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:02,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:02,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 336 transitions, 4532 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:02,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:02,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:03,621 INFO L124 PetriNetUnfolderBase]: 5687/9058 cut-off events. [2024-06-27 18:57:03,621 INFO L125 PetriNetUnfolderBase]: For 195291/195300 co-relation queries the response was YES. [2024-06-27 18:57:03,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56096 conditions, 9058 events. 5687/9058 cut-off events. For 195291/195300 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 59614 event pairs, 1382 based on Foata normal form. 10/8853 useless extension candidates. Maximal degree in co-relation 55980. Up to 7757 conditions per place. [2024-06-27 18:57:03,723 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 300 selfloop transitions, 61 changer transitions 0/370 dead transitions. [2024-06-27 18:57:03,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 370 transitions, 5408 flow [2024-06-27 18:57:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 18:57:03,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515527950310559 [2024-06-27 18:57:03,725 INFO L175 Difference]: Start difference. First operand has 238 places, 336 transitions, 4532 flow. Second operand 7 states and 166 transitions. [2024-06-27 18:57:03,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 370 transitions, 5408 flow [2024-06-27 18:57:04,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 370 transitions, 5242 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:57:04,130 INFO L231 Difference]: Finished difference. Result has 238 places, 336 transitions, 4505 flow [2024-06-27 18:57:04,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4366, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4505, PETRI_PLACES=238, PETRI_TRANSITIONS=336} [2024-06-27 18:57:04,130 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 186 predicate places. [2024-06-27 18:57:04,130 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 336 transitions, 4505 flow [2024-06-27 18:57:04,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:04,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:04,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:57:04,130 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:04,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1661925406, now seen corresponding path program 8 times [2024-06-27 18:57:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827773213] [2024-06-27 18:57:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827773213] [2024-06-27 18:57:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827773213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489733023] [2024-06-27 18:57:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:04,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:04,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 336 transitions, 4505 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:04,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:04,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:04,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:06,353 INFO L124 PetriNetUnfolderBase]: 5755/9140 cut-off events. [2024-06-27 18:57:06,353 INFO L125 PetriNetUnfolderBase]: For 202409/202418 co-relation queries the response was YES. [2024-06-27 18:57:06,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56982 conditions, 9140 events. 5755/9140 cut-off events. For 202409/202418 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 60037 event pairs, 1353 based on Foata normal form. 10/8947 useless extension candidates. Maximal degree in co-relation 56865. Up to 7424 conditions per place. [2024-06-27 18:57:06,453 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 271 selfloop transitions, 94 changer transitions 0/374 dead transitions. [2024-06-27 18:57:06,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 374 transitions, 5574 flow [2024-06-27 18:57:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 18:57:06,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:57:06,455 INFO L175 Difference]: Start difference. First operand has 238 places, 336 transitions, 4505 flow. Second operand 7 states and 168 transitions. [2024-06-27 18:57:06,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 374 transitions, 5574 flow [2024-06-27 18:57:06,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 374 transitions, 5458 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 18:57:06,855 INFO L231 Difference]: Finished difference. Result has 238 places, 339 transitions, 4655 flow [2024-06-27 18:57:06,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4393, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4655, PETRI_PLACES=238, PETRI_TRANSITIONS=339} [2024-06-27 18:57:06,856 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 186 predicate places. [2024-06-27 18:57:06,856 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 339 transitions, 4655 flow [2024-06-27 18:57:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:06,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:06,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:06,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:57:06,857 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:06,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1911788506, now seen corresponding path program 9 times [2024-06-27 18:57:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579738558] [2024-06-27 18:57:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579738558] [2024-06-27 18:57:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579738558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237109883] [2024-06-27 18:57:07,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:07,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:07,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:07,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:07,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:07,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 339 transitions, 4655 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:07,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:07,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:07,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:09,146 INFO L124 PetriNetUnfolderBase]: 5823/9343 cut-off events. [2024-06-27 18:57:09,146 INFO L125 PetriNetUnfolderBase]: For 204091/204100 co-relation queries the response was YES. [2024-06-27 18:57:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58202 conditions, 9343 events. 5823/9343 cut-off events. For 204091/204100 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 62314 event pairs, 1578 based on Foata normal form. 10/9136 useless extension candidates. Maximal degree in co-relation 58086. Up to 8261 conditions per place. [2024-06-27 18:57:09,245 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 326 selfloop transitions, 29 changer transitions 0/364 dead transitions. [2024-06-27 18:57:09,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 364 transitions, 5519 flow [2024-06-27 18:57:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-06-27 18:57:09,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 18:57:09,246 INFO L175 Difference]: Start difference. First operand has 238 places, 339 transitions, 4655 flow. Second operand 7 states and 154 transitions. [2024-06-27 18:57:09,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 364 transitions, 5519 flow [2024-06-27 18:57:09,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 364 transitions, 5329 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-27 18:57:09,609 INFO L231 Difference]: Finished difference. Result has 240 places, 342 transitions, 4605 flow [2024-06-27 18:57:09,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4468, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4605, PETRI_PLACES=240, PETRI_TRANSITIONS=342} [2024-06-27 18:57:09,609 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 188 predicate places. [2024-06-27 18:57:09,610 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 342 transitions, 4605 flow [2024-06-27 18:57:09,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:09,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:09,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:09,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 18:57:09,610 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:09,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1917532186, now seen corresponding path program 10 times [2024-06-27 18:57:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764092797] [2024-06-27 18:57:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:10,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:10,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764092797] [2024-06-27 18:57:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764092797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582454671] [2024-06-27 18:57:10,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:10,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:10,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:10,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:10,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 342 transitions, 4605 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:10,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:10,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:10,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:11,893 INFO L124 PetriNetUnfolderBase]: 5811/9327 cut-off events. [2024-06-27 18:57:11,894 INFO L125 PetriNetUnfolderBase]: For 197998/198007 co-relation queries the response was YES. [2024-06-27 18:57:11,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56877 conditions, 9327 events. 5811/9327 cut-off events. For 197998/198007 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 62219 event pairs, 1562 based on Foata normal form. 10/9124 useless extension candidates. Maximal degree in co-relation 56761. Up to 8121 conditions per place. [2024-06-27 18:57:12,008 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 322 selfloop transitions, 37 changer transitions 0/368 dead transitions. [2024-06-27 18:57:12,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 368 transitions, 5451 flow [2024-06-27 18:57:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-06-27 18:57:12,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906832298136646 [2024-06-27 18:57:12,009 INFO L175 Difference]: Start difference. First operand has 240 places, 342 transitions, 4605 flow. Second operand 7 states and 158 transitions. [2024-06-27 18:57:12,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 368 transitions, 5451 flow [2024-06-27 18:57:12,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 368 transitions, 5292 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-27 18:57:12,429 INFO L231 Difference]: Finished difference. Result has 242 places, 342 transitions, 4526 flow [2024-06-27 18:57:12,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4446, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4526, PETRI_PLACES=242, PETRI_TRANSITIONS=342} [2024-06-27 18:57:12,430 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 190 predicate places. [2024-06-27 18:57:12,430 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 342 transitions, 4526 flow [2024-06-27 18:57:12,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:12,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:12,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 18:57:12,430 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:12,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1927035515, now seen corresponding path program 2 times [2024-06-27 18:57:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751296838] [2024-06-27 18:57:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751296838] [2024-06-27 18:57:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751296838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318490598] [2024-06-27 18:57:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:13,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:13,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:13,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:13,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 342 transitions, 4526 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:13,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:13,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:13,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:14,869 INFO L124 PetriNetUnfolderBase]: 6029/9579 cut-off events. [2024-06-27 18:57:14,869 INFO L125 PetriNetUnfolderBase]: For 213096/213102 co-relation queries the response was YES. [2024-06-27 18:57:14,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58638 conditions, 9579 events. 6029/9579 cut-off events. For 213096/213102 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 63323 event pairs, 1520 based on Foata normal form. 9/9394 useless extension candidates. Maximal degree in co-relation 58522. Up to 7924 conditions per place. [2024-06-27 18:57:14,995 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 333 selfloop transitions, 40 changer transitions 0/382 dead transitions. [2024-06-27 18:57:14,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 382 transitions, 5622 flow [2024-06-27 18:57:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 18:57:14,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515527950310559 [2024-06-27 18:57:14,996 INFO L175 Difference]: Start difference. First operand has 242 places, 342 transitions, 4526 flow. Second operand 7 states and 166 transitions. [2024-06-27 18:57:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 382 transitions, 5622 flow [2024-06-27 18:57:15,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 382 transitions, 5363 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 18:57:15,437 INFO L231 Difference]: Finished difference. Result has 241 places, 344 transitions, 4381 flow [2024-06-27 18:57:15,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4267, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4381, PETRI_PLACES=241, PETRI_TRANSITIONS=344} [2024-06-27 18:57:15,437 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 189 predicate places. [2024-06-27 18:57:15,437 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 344 transitions, 4381 flow [2024-06-27 18:57:15,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:15,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:15,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:15,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 18:57:15,438 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:15,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1911798395, now seen corresponding path program 3 times [2024-06-27 18:57:15,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:15,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182596730] [2024-06-27 18:57:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182596730] [2024-06-27 18:57:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182596730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425999601] [2024-06-27 18:57:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:16,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:16,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:16,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:16,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 344 transitions, 4381 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:16,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:16,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:16,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:18,119 INFO L124 PetriNetUnfolderBase]: 6001/9597 cut-off events. [2024-06-27 18:57:18,120 INFO L125 PetriNetUnfolderBase]: For 208815/208821 co-relation queries the response was YES. [2024-06-27 18:57:18,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57269 conditions, 9597 events. 6001/9597 cut-off events. For 208815/208821 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 64054 event pairs, 1574 based on Foata normal form. 13/9402 useless extension candidates. Maximal degree in co-relation 57154. Up to 8226 conditions per place. [2024-06-27 18:57:18,236 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 332 selfloop transitions, 38 changer transitions 0/379 dead transitions. [2024-06-27 18:57:18,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 379 transitions, 5337 flow [2024-06-27 18:57:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:57:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:57:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-06-27 18:57:18,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2024-06-27 18:57:18,237 INFO L175 Difference]: Start difference. First operand has 241 places, 344 transitions, 4381 flow. Second operand 7 states and 164 transitions. [2024-06-27 18:57:18,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 379 transitions, 5337 flow [2024-06-27 18:57:18,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 379 transitions, 5287 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 18:57:18,650 INFO L231 Difference]: Finished difference. Result has 245 places, 344 transitions, 4412 flow [2024-06-27 18:57:18,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4331, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4412, PETRI_PLACES=245, PETRI_TRANSITIONS=344} [2024-06-27 18:57:18,651 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 193 predicate places. [2024-06-27 18:57:18,651 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 344 transitions, 4412 flow [2024-06-27 18:57:18,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:18,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:18,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:18,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 18:57:18,651 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:18,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1975879068, now seen corresponding path program 1 times [2024-06-27 18:57:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408679081] [2024-06-27 18:57:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408679081] [2024-06-27 18:57:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408679081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235022735] [2024-06-27 18:57:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:19,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:19,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:19,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:19,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:57:19,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 344 transitions, 4412 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:19,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:19,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:57:19,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:21,462 INFO L124 PetriNetUnfolderBase]: 6111/9741 cut-off events. [2024-06-27 18:57:21,462 INFO L125 PetriNetUnfolderBase]: For 233194/233316 co-relation queries the response was YES. [2024-06-27 18:57:21,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59769 conditions, 9741 events. 6111/9741 cut-off events. For 233194/233316 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 65389 event pairs, 1207 based on Foata normal form. 39/9510 useless extension candidates. Maximal degree in co-relation 59652. Up to 6487 conditions per place. [2024-06-27 18:57:21,566 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 255 selfloop transitions, 137 changer transitions 0/422 dead transitions. [2024-06-27 18:57:21,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 422 transitions, 6032 flow [2024-06-27 18:57:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:57:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:57:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-27 18:57:21,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-06-27 18:57:21,568 INFO L175 Difference]: Start difference. First operand has 245 places, 344 transitions, 4412 flow. Second operand 9 states and 231 transitions. [2024-06-27 18:57:21,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 422 transitions, 6032 flow [2024-06-27 18:57:21,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 422 transitions, 5946 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 18:57:21,989 INFO L231 Difference]: Finished difference. Result has 250 places, 360 transitions, 4973 flow [2024-06-27 18:57:21,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4326, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4973, PETRI_PLACES=250, PETRI_TRANSITIONS=360} [2024-06-27 18:57:21,990 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 198 predicate places. [2024-06-27 18:57:21,990 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 360 transitions, 4973 flow [2024-06-27 18:57:21,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:21,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:21,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:21,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 18:57:21,990 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:21,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1975818494, now seen corresponding path program 1 times [2024-06-27 18:57:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001081466] [2024-06-27 18:57:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001081466] [2024-06-27 18:57:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001081466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769729677] [2024-06-27 18:57:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:22,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:22,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:22,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 360 transitions, 4973 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:22,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:22,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:22,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:24,607 INFO L124 PetriNetUnfolderBase]: 6431/10249 cut-off events. [2024-06-27 18:57:24,608 INFO L125 PetriNetUnfolderBase]: For 250877/250877 co-relation queries the response was YES. [2024-06-27 18:57:24,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65374 conditions, 10249 events. 6431/10249 cut-off events. For 250877/250877 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 68834 event pairs, 1530 based on Foata normal form. 2/10039 useless extension candidates. Maximal degree in co-relation 65254. Up to 8637 conditions per place. [2024-06-27 18:57:24,752 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 360 selfloop transitions, 86 changer transitions 0/455 dead transitions. [2024-06-27 18:57:24,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 455 transitions, 6803 flow [2024-06-27 18:57:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:57:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:57:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 18:57:24,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:57:24,753 INFO L175 Difference]: Start difference. First operand has 250 places, 360 transitions, 4973 flow. Second operand 9 states and 216 transitions. [2024-06-27 18:57:24,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 455 transitions, 6803 flow [2024-06-27 18:57:25,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 455 transitions, 6711 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 18:57:25,329 INFO L231 Difference]: Finished difference. Result has 260 places, 391 transitions, 5617 flow [2024-06-27 18:57:25,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4881, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5617, PETRI_PLACES=260, PETRI_TRANSITIONS=391} [2024-06-27 18:57:25,330 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 208 predicate places. [2024-06-27 18:57:25,330 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 391 transitions, 5617 flow [2024-06-27 18:57:25,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:25,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:25,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 18:57:25,330 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:25,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1535711096, now seen corresponding path program 2 times [2024-06-27 18:57:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768184849] [2024-06-27 18:57:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768184849] [2024-06-27 18:57:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768184849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869264377] [2024-06-27 18:57:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:26,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:26,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:57:26,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 391 transitions, 5617 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:26,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:26,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:57:26,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:28,201 INFO L124 PetriNetUnfolderBase]: 6349/10158 cut-off events. [2024-06-27 18:57:28,201 INFO L125 PetriNetUnfolderBase]: For 275983/276105 co-relation queries the response was YES. [2024-06-27 18:57:28,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66977 conditions, 10158 events. 6349/10158 cut-off events. For 275983/276105 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 68975 event pairs, 1455 based on Foata normal form. 41/9901 useless extension candidates. Maximal degree in co-relation 66851. Up to 7990 conditions per place. [2024-06-27 18:57:28,331 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 272 selfloop transitions, 142 changer transitions 0/449 dead transitions. [2024-06-27 18:57:28,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 449 transitions, 6775 flow [2024-06-27 18:57:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:57:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:57:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 18:57:28,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2024-06-27 18:57:28,334 INFO L175 Difference]: Start difference. First operand has 260 places, 391 transitions, 5617 flow. Second operand 10 states and 245 transitions. [2024-06-27 18:57:28,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 449 transitions, 6775 flow [2024-06-27 18:57:29,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 449 transitions, 6627 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-06-27 18:57:29,089 INFO L231 Difference]: Finished difference. Result has 269 places, 393 transitions, 5847 flow [2024-06-27 18:57:29,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5469, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5847, PETRI_PLACES=269, PETRI_TRANSITIONS=393} [2024-06-27 18:57:29,090 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 217 predicate places. [2024-06-27 18:57:29,090 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 393 transitions, 5847 flow [2024-06-27 18:57:29,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:29,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:29,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:29,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 18:57:29,090 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:29,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1973021984, now seen corresponding path program 2 times [2024-06-27 18:57:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321380301] [2024-06-27 18:57:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321380301] [2024-06-27 18:57:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321380301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:29,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397948509] [2024-06-27 18:57:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:29,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:29,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:29,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 393 transitions, 5847 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:29,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:29,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:29,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:31,929 INFO L124 PetriNetUnfolderBase]: 6643/10770 cut-off events. [2024-06-27 18:57:31,930 INFO L125 PetriNetUnfolderBase]: For 289547/289547 co-relation queries the response was YES. [2024-06-27 18:57:32,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70727 conditions, 10770 events. 6643/10770 cut-off events. For 289547/289547 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 74732 event pairs, 1651 based on Foata normal form. 2/10488 useless extension candidates. Maximal degree in co-relation 70598. Up to 9202 conditions per place. [2024-06-27 18:57:32,080 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 381 selfloop transitions, 58 changer transitions 0/448 dead transitions. [2024-06-27 18:57:32,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 448 transitions, 7012 flow [2024-06-27 18:57:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:57:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:57:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2024-06-27 18:57:32,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934782608695652 [2024-06-27 18:57:32,081 INFO L175 Difference]: Start difference. First operand has 269 places, 393 transitions, 5847 flow. Second operand 10 states and 227 transitions. [2024-06-27 18:57:32,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 448 transitions, 7012 flow [2024-06-27 18:57:32,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 448 transitions, 6599 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-27 18:57:32,856 INFO L231 Difference]: Finished difference. Result has 271 places, 398 transitions, 5628 flow [2024-06-27 18:57:32,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5436, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5628, PETRI_PLACES=271, PETRI_TRANSITIONS=398} [2024-06-27 18:57:32,857 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 219 predicate places. [2024-06-27 18:57:32,857 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 398 transitions, 5628 flow [2024-06-27 18:57:32,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:32,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:32,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 18:57:32,858 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:32,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1857730814, now seen corresponding path program 3 times [2024-06-27 18:57:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:32,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791111812] [2024-06-27 18:57:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791111812] [2024-06-27 18:57:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791111812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:33,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:33,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837528319] [2024-06-27 18:57:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:33,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:33,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:33,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:33,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:33,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 398 transitions, 5628 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:33,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:33,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:33,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:35,798 INFO L124 PetriNetUnfolderBase]: 6717/10740 cut-off events. [2024-06-27 18:57:35,798 INFO L125 PetriNetUnfolderBase]: For 286200/286200 co-relation queries the response was YES. [2024-06-27 18:57:35,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70440 conditions, 10740 events. 6717/10740 cut-off events. For 286200/286200 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 73232 event pairs, 1656 based on Foata normal form. 2/10491 useless extension candidates. Maximal degree in co-relation 70310. Up to 9410 conditions per place. [2024-06-27 18:57:35,964 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 403 selfloop transitions, 43 changer transitions 0/455 dead transitions. [2024-06-27 18:57:35,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 455 transitions, 6952 flow [2024-06-27 18:57:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:57:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:57:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 228 transitions. [2024-06-27 18:57:35,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2024-06-27 18:57:35,965 INFO L175 Difference]: Start difference. First operand has 271 places, 398 transitions, 5628 flow. Second operand 10 states and 228 transitions. [2024-06-27 18:57:35,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 455 transitions, 6952 flow [2024-06-27 18:57:36,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 455 transitions, 6866 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-27 18:57:36,896 INFO L231 Difference]: Finished difference. Result has 277 places, 405 transitions, 5746 flow [2024-06-27 18:57:36,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5542, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5746, PETRI_PLACES=277, PETRI_TRANSITIONS=405} [2024-06-27 18:57:36,896 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 225 predicate places. [2024-06-27 18:57:36,896 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 405 transitions, 5746 flow [2024-06-27 18:57:36,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:36,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:36,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:36,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 18:57:36,897 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:36,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438718, now seen corresponding path program 1 times [2024-06-27 18:57:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866893020] [2024-06-27 18:57:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866893020] [2024-06-27 18:57:37,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866893020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:37,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:37,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:37,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043553112] [2024-06-27 18:57:37,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:37,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:37,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:37,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 405 transitions, 5746 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:37,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:37,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:37,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:39,788 INFO L124 PetriNetUnfolderBase]: 6745/10809 cut-off events. [2024-06-27 18:57:39,788 INFO L125 PetriNetUnfolderBase]: For 292855/292855 co-relation queries the response was YES. [2024-06-27 18:57:39,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71121 conditions, 10809 events. 6745/10809 cut-off events. For 292855/292855 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 74064 event pairs, 1669 based on Foata normal form. 2/10551 useless extension candidates. Maximal degree in co-relation 70988. Up to 9565 conditions per place. [2024-06-27 18:57:39,948 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 405 selfloop transitions, 29 changer transitions 0/443 dead transitions. [2024-06-27 18:57:39,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 443 transitions, 6800 flow [2024-06-27 18:57:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:57:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:57:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 18:57:39,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2024-06-27 18:57:39,949 INFO L175 Difference]: Start difference. First operand has 277 places, 405 transitions, 5746 flow. Second operand 8 states and 180 transitions. [2024-06-27 18:57:39,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 443 transitions, 6800 flow [2024-06-27 18:57:40,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 443 transitions, 6725 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 18:57:40,778 INFO L231 Difference]: Finished difference. Result has 279 places, 407 transitions, 5766 flow [2024-06-27 18:57:40,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5671, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5766, PETRI_PLACES=279, PETRI_TRANSITIONS=407} [2024-06-27 18:57:40,779 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 227 predicate places. [2024-06-27 18:57:40,779 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 407 transitions, 5766 flow [2024-06-27 18:57:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:40,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:40,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:40,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 18:57:40,779 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:40,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 667152970, now seen corresponding path program 4 times [2024-06-27 18:57:40,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:40,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194706982] [2024-06-27 18:57:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194706982] [2024-06-27 18:57:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194706982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480745675] [2024-06-27 18:57:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:41,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:41,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 407 transitions, 5766 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:41,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:44,026 INFO L124 PetriNetUnfolderBase]: 6739/10778 cut-off events. [2024-06-27 18:57:44,027 INFO L125 PetriNetUnfolderBase]: For 297736/297736 co-relation queries the response was YES. [2024-06-27 18:57:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71370 conditions, 10778 events. 6739/10778 cut-off events. For 297736/297736 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 73629 event pairs, 1670 based on Foata normal form. 2/10527 useless extension candidates. Maximal degree in co-relation 71235. Up to 9445 conditions per place. [2024-06-27 18:57:44,169 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 404 selfloop transitions, 42 changer transitions 0/455 dead transitions. [2024-06-27 18:57:44,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 455 transitions, 6890 flow [2024-06-27 18:57:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:57:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:57:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2024-06-27 18:57:44,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2024-06-27 18:57:44,170 INFO L175 Difference]: Start difference. First operand has 279 places, 407 transitions, 5766 flow. Second operand 10 states and 225 transitions. [2024-06-27 18:57:44,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 455 transitions, 6890 flow [2024-06-27 18:57:45,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 455 transitions, 6789 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 18:57:45,009 INFO L231 Difference]: Finished difference. Result has 283 places, 408 transitions, 5769 flow [2024-06-27 18:57:45,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5669, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5769, PETRI_PLACES=283, PETRI_TRANSITIONS=408} [2024-06-27 18:57:45,009 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 231 predicate places. [2024-06-27 18:57:45,009 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 408 transitions, 5769 flow [2024-06-27 18:57:45,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:45,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:45,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:45,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 18:57:45,010 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:45,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1857730938, now seen corresponding path program 3 times [2024-06-27 18:57:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313917226] [2024-06-27 18:57:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:45,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313917226] [2024-06-27 18:57:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313917226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956201807] [2024-06-27 18:57:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:45,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:45,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:57:45,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 408 transitions, 5769 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:45,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:45,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:57:45,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:47,969 INFO L124 PetriNetUnfolderBase]: 6666/10651 cut-off events. [2024-06-27 18:57:47,970 INFO L125 PetriNetUnfolderBase]: For 323386/323504 co-relation queries the response was YES. [2024-06-27 18:57:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71108 conditions, 10651 events. 6666/10651 cut-off events. For 323386/323504 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 72768 event pairs, 1621 based on Foata normal form. 37/10393 useless extension candidates. Maximal degree in co-relation 70972. Up to 8889 conditions per place. [2024-06-27 18:57:48,106 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 347 selfloop transitions, 70 changer transitions 0/458 dead transitions. [2024-06-27 18:57:48,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 458 transitions, 6924 flow [2024-06-27 18:57:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:57:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:57:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 18:57:48,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2024-06-27 18:57:48,107 INFO L175 Difference]: Start difference. First operand has 283 places, 408 transitions, 5769 flow. Second operand 9 states and 212 transitions. [2024-06-27 18:57:48,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 458 transitions, 6924 flow [2024-06-27 18:57:48,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 458 transitions, 6840 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:57:48,940 INFO L231 Difference]: Finished difference. Result has 285 places, 413 transitions, 5924 flow [2024-06-27 18:57:48,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5685, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5924, PETRI_PLACES=285, PETRI_TRANSITIONS=413} [2024-06-27 18:57:48,940 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 233 predicate places. [2024-06-27 18:57:48,940 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 413 transitions, 5924 flow [2024-06-27 18:57:48,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:48,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:48,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 18:57:48,941 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:48,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -57176998, now seen corresponding path program 5 times [2024-06-27 18:57:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028408500] [2024-06-27 18:57:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028408500] [2024-06-27 18:57:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028408500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121757346] [2024-06-27 18:57:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:49,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:49,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:49,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 413 transitions, 5924 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:49,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:49,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:49,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:51,927 INFO L124 PetriNetUnfolderBase]: 7014/11052 cut-off events. [2024-06-27 18:57:51,927 INFO L125 PetriNetUnfolderBase]: For 314718/314718 co-relation queries the response was YES. [2024-06-27 18:57:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74774 conditions, 11052 events. 7014/11052 cut-off events. For 314718/314718 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 74073 event pairs, 1650 based on Foata normal form. 2/10849 useless extension candidates. Maximal degree in co-relation 74637. Up to 9785 conditions per place. [2024-06-27 18:57:52,068 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 408 selfloop transitions, 59 changer transitions 0/476 dead transitions. [2024-06-27 18:57:52,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 476 transitions, 7449 flow [2024-06-27 18:57:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:57:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:57:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 18:57:52,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-27 18:57:52,069 INFO L175 Difference]: Start difference. First operand has 285 places, 413 transitions, 5924 flow. Second operand 8 states and 190 transitions. [2024-06-27 18:57:52,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 476 transitions, 7449 flow [2024-06-27 18:57:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 476 transitions, 7313 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 18:57:52,945 INFO L231 Difference]: Finished difference. Result has 289 places, 430 transitions, 6252 flow [2024-06-27 18:57:52,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5788, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6252, PETRI_PLACES=289, PETRI_TRANSITIONS=430} [2024-06-27 18:57:52,945 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 237 predicate places. [2024-06-27 18:57:52,945 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 430 transitions, 6252 flow [2024-06-27 18:57:52,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:52,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:52,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 18:57:52,945 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:52,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -450195768, now seen corresponding path program 4 times [2024-06-27 18:57:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546844373] [2024-06-27 18:57:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546844373] [2024-06-27 18:57:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546844373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:57:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986570394] [2024-06-27 18:57:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:57:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:57:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:57:53,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:57:53,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 430 transitions, 6252 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:53,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:53,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:57:53,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:56,011 INFO L124 PetriNetUnfolderBase]: 6860/10991 cut-off events. [2024-06-27 18:57:56,011 INFO L125 PetriNetUnfolderBase]: For 334213/334333 co-relation queries the response was YES. [2024-06-27 18:57:56,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73719 conditions, 10991 events. 6860/10991 cut-off events. For 334213/334333 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 75672 event pairs, 1531 based on Foata normal form. 39/10729 useless extension candidates. Maximal degree in co-relation 73579. Up to 8720 conditions per place. [2024-06-27 18:57:56,158 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 367 selfloop transitions, 71 changer transitions 0/483 dead transitions. [2024-06-27 18:57:56,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 483 transitions, 7437 flow [2024-06-27 18:57:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:57:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:57:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 18:57:56,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2024-06-27 18:57:56,159 INFO L175 Difference]: Start difference. First operand has 289 places, 430 transitions, 6252 flow. Second operand 8 states and 202 transitions. [2024-06-27 18:57:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 483 transitions, 7437 flow [2024-06-27 18:57:57,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 483 transitions, 7355 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-27 18:57:57,052 INFO L231 Difference]: Finished difference. Result has 296 places, 434 transitions, 6418 flow [2024-06-27 18:57:57,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6170, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6418, PETRI_PLACES=296, PETRI_TRANSITIONS=434} [2024-06-27 18:57:57,053 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 244 predicate places. [2024-06-27 18:57:57,053 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 434 transitions, 6418 flow [2024-06-27 18:57:57,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:57,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:57,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:57:57,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 18:57:57,053 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:57,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1917548058, now seen corresponding path program 2 times [2024-06-27 18:57:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419688237] [2024-06-27 18:57:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:57,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419688237] [2024-06-27 18:57:57,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419688237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:57,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710794889] [2024-06-27 18:57:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:57,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:57,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:57:57,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 434 transitions, 6418 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:57,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:57,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:57:57,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:59,984 INFO L124 PetriNetUnfolderBase]: 7177/11378 cut-off events. [2024-06-27 18:57:59,985 INFO L125 PetriNetUnfolderBase]: For 332349/332349 co-relation queries the response was YES. [2024-06-27 18:58:00,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77629 conditions, 11378 events. 7177/11378 cut-off events. For 332349/332349 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 77522 event pairs, 1924 based on Foata normal form. 2/11147 useless extension candidates. Maximal degree in co-relation 77486. Up to 10266 conditions per place. [2024-06-27 18:58:00,131 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 435 selfloop transitions, 17 changer transitions 0/461 dead transitions. [2024-06-27 18:58:00,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 461 transitions, 7454 flow [2024-06-27 18:58:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-27 18:58:00,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720496894409938 [2024-06-27 18:58:00,132 INFO L175 Difference]: Start difference. First operand has 296 places, 434 transitions, 6418 flow. Second operand 7 states and 152 transitions. [2024-06-27 18:58:00,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 461 transitions, 7454 flow [2024-06-27 18:58:00,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 461 transitions, 7359 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:00,983 INFO L231 Difference]: Finished difference. Result has 299 places, 436 transitions, 6398 flow [2024-06-27 18:58:00,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6323, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6398, PETRI_PLACES=299, PETRI_TRANSITIONS=436} [2024-06-27 18:58:00,984 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 247 predicate places. [2024-06-27 18:58:00,984 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 436 transitions, 6398 flow [2024-06-27 18:58:00,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:00,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:00,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:00,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 18:58:00,984 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:00,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1661756704, now seen corresponding path program 6 times [2024-06-27 18:58:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515642839] [2024-06-27 18:58:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515642839] [2024-06-27 18:58:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515642839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:01,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047060964] [2024-06-27 18:58:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:01,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:01,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:01,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:01,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 436 transitions, 6398 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:01,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:01,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:01,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:04,204 INFO L124 PetriNetUnfolderBase]: 7246/11629 cut-off events. [2024-06-27 18:58:04,204 INFO L125 PetriNetUnfolderBase]: For 338923/338923 co-relation queries the response was YES. [2024-06-27 18:58:04,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78248 conditions, 11629 events. 7246/11629 cut-off events. For 338923/338923 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 80939 event pairs, 1806 based on Foata normal form. 2/11344 useless extension candidates. Maximal degree in co-relation 78104. Up to 10109 conditions per place. [2024-06-27 18:58:04,365 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 439 selfloop transitions, 48 changer transitions 0/496 dead transitions. [2024-06-27 18:58:04,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 496 transitions, 7850 flow [2024-06-27 18:58:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:58:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:58:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-06-27 18:58:04,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169082125603864 [2024-06-27 18:58:04,366 INFO L175 Difference]: Start difference. First operand has 299 places, 436 transitions, 6398 flow. Second operand 9 states and 214 transitions. [2024-06-27 18:58:04,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 496 transitions, 7850 flow [2024-06-27 18:58:05,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 496 transitions, 7798 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:05,346 INFO L231 Difference]: Finished difference. Result has 305 places, 446 transitions, 6623 flow [2024-06-27 18:58:05,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6346, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6623, PETRI_PLACES=305, PETRI_TRANSITIONS=446} [2024-06-27 18:58:05,346 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 253 predicate places. [2024-06-27 18:58:05,346 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 446 transitions, 6623 flow [2024-06-27 18:58:05,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:05,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:05,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:05,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 18:58:05,347 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:05,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1917541114, now seen corresponding path program 7 times [2024-06-27 18:58:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:05,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720694933] [2024-06-27 18:58:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720694933] [2024-06-27 18:58:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720694933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:06,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338938591] [2024-06-27 18:58:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:06,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:06,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:06,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:06,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 446 transitions, 6623 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:06,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:06,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:06,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:08,541 INFO L124 PetriNetUnfolderBase]: 7299/11549 cut-off events. [2024-06-27 18:58:08,541 INFO L125 PetriNetUnfolderBase]: For 347901/347901 co-relation queries the response was YES. [2024-06-27 18:58:08,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79217 conditions, 11549 events. 7299/11549 cut-off events. For 347901/347901 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 78699 event pairs, 1907 based on Foata normal form. 3/11318 useless extension candidates. Maximal degree in co-relation 79070. Up to 10328 conditions per place. [2024-06-27 18:58:08,691 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 450 selfloop transitions, 33 changer transitions 0/492 dead transitions. [2024-06-27 18:58:08,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 492 transitions, 8067 flow [2024-06-27 18:58:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:58:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:58:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 18:58:08,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2024-06-27 18:58:08,692 INFO L175 Difference]: Start difference. First operand has 305 places, 446 transitions, 6623 flow. Second operand 8 states and 178 transitions. [2024-06-27 18:58:08,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 492 transitions, 8067 flow [2024-06-27 18:58:09,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 492 transitions, 7988 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:09,579 INFO L231 Difference]: Finished difference. Result has 310 places, 455 transitions, 6834 flow [2024-06-27 18:58:09,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6552, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6834, PETRI_PLACES=310, PETRI_TRANSITIONS=455} [2024-06-27 18:58:09,580 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 258 predicate places. [2024-06-27 18:58:09,580 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 455 transitions, 6834 flow [2024-06-27 18:58:09,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:09,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:09,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 18:58:09,580 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1926715998, now seen corresponding path program 3 times [2024-06-27 18:58:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201295899] [2024-06-27 18:58:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201295899] [2024-06-27 18:58:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201295899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514424121] [2024-06-27 18:58:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:10,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:10,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:10,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 455 transitions, 6834 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:10,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:10,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:10,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:12,654 INFO L124 PetriNetUnfolderBase]: 7327/11596 cut-off events. [2024-06-27 18:58:12,654 INFO L125 PetriNetUnfolderBase]: For 354318/354318 co-relation queries the response was YES. [2024-06-27 18:58:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79743 conditions, 11596 events. 7327/11596 cut-off events. For 354318/354318 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 78972 event pairs, 1928 based on Foata normal form. 2/11362 useless extension candidates. Maximal degree in co-relation 79593. Up to 10414 conditions per place. [2024-06-27 18:58:12,812 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 453 selfloop transitions, 25 changer transitions 0/487 dead transitions. [2024-06-27 18:58:12,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 487 transitions, 7964 flow [2024-06-27 18:58:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-06-27 18:58:12,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813664596273292 [2024-06-27 18:58:12,813 INFO L175 Difference]: Start difference. First operand has 310 places, 455 transitions, 6834 flow. Second operand 7 states and 155 transitions. [2024-06-27 18:58:12,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 487 transitions, 7964 flow [2024-06-27 18:58:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 487 transitions, 7834 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-27 18:58:13,651 INFO L231 Difference]: Finished difference. Result has 312 places, 457 transitions, 6802 flow [2024-06-27 18:58:13,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6704, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6802, PETRI_PLACES=312, PETRI_TRANSITIONS=457} [2024-06-27 18:58:13,651 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 260 predicate places. [2024-06-27 18:58:13,651 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 457 transitions, 6802 flow [2024-06-27 18:58:13,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:13,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:13,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:13,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 18:58:13,652 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:13,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1926715750, now seen corresponding path program 1 times [2024-06-27 18:58:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282330064] [2024-06-27 18:58:13,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282330064] [2024-06-27 18:58:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282330064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663144218] [2024-06-27 18:58:14,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:14,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:14,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:14,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 457 transitions, 6802 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:14,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:14,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:14,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:16,770 INFO L124 PetriNetUnfolderBase]: 7322/11605 cut-off events. [2024-06-27 18:58:16,771 INFO L125 PetriNetUnfolderBase]: For 358105/358105 co-relation queries the response was YES. [2024-06-27 18:58:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79732 conditions, 11605 events. 7322/11605 cut-off events. For 358105/358105 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 79282 event pairs, 1919 based on Foata normal form. 1/11366 useless extension candidates. Maximal degree in co-relation 79581. Up to 10407 conditions per place. [2024-06-27 18:58:16,924 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 451 selfloop transitions, 27 changer transitions 0/487 dead transitions. [2024-06-27 18:58:16,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 487 transitions, 7902 flow [2024-06-27 18:58:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 18:58:16,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484472049689441 [2024-06-27 18:58:16,925 INFO L175 Difference]: Start difference. First operand has 312 places, 457 transitions, 6802 flow. Second operand 7 states and 156 transitions. [2024-06-27 18:58:16,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 487 transitions, 7902 flow [2024-06-27 18:58:17,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 487 transitions, 7775 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:17,811 INFO L231 Difference]: Finished difference. Result has 315 places, 457 transitions, 6739 flow [2024-06-27 18:58:17,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6675, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6739, PETRI_PLACES=315, PETRI_TRANSITIONS=457} [2024-06-27 18:58:17,812 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 263 predicate places. [2024-06-27 18:58:17,812 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 457 transitions, 6739 flow [2024-06-27 18:58:17,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:17,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:17,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:17,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 18:58:17,812 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:17,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1927041498, now seen corresponding path program 4 times [2024-06-27 18:58:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346969885] [2024-06-27 18:58:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346969885] [2024-06-27 18:58:18,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346969885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:18,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:18,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366247971] [2024-06-27 18:58:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:18,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:18,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:18,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:18,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 457 transitions, 6739 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:18,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:18,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:18,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:20,855 INFO L124 PetriNetUnfolderBase]: 7358/11604 cut-off events. [2024-06-27 18:58:20,855 INFO L125 PetriNetUnfolderBase]: For 357831/357831 co-relation queries the response was YES. [2024-06-27 18:58:20,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79452 conditions, 11604 events. 7358/11604 cut-off events. For 357831/357831 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 78637 event pairs, 1919 based on Foata normal form. 2/11379 useless extension candidates. Maximal degree in co-relation 79299. Up to 10491 conditions per place. [2024-06-27 18:58:21,010 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 462 selfloop transitions, 20 changer transitions 0/491 dead transitions. [2024-06-27 18:58:21,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 491 transitions, 7886 flow [2024-06-27 18:58:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-06-27 18:58:21,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 18:58:21,011 INFO L175 Difference]: Start difference. First operand has 315 places, 457 transitions, 6739 flow. Second operand 7 states and 154 transitions. [2024-06-27 18:58:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 491 transitions, 7886 flow [2024-06-27 18:58:21,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 491 transitions, 7832 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 18:58:21,870 INFO L231 Difference]: Finished difference. Result has 317 places, 462 transitions, 6811 flow [2024-06-27 18:58:21,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6685, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6811, PETRI_PLACES=317, PETRI_TRANSITIONS=462} [2024-06-27 18:58:21,870 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 265 predicate places. [2024-06-27 18:58:21,870 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 462 transitions, 6811 flow [2024-06-27 18:58:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:21,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:21,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:21,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 18:58:21,870 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:21,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -450011070, now seen corresponding path program 5 times [2024-06-27 18:58:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653880850] [2024-06-27 18:58:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653880850] [2024-06-27 18:58:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653880850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380107794] [2024-06-27 18:58:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:22,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:22,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 462 transitions, 6811 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:22,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:22,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:25,041 INFO L124 PetriNetUnfolderBase]: 7361/11725 cut-off events. [2024-06-27 18:58:25,041 INFO L125 PetriNetUnfolderBase]: For 366666/366666 co-relation queries the response was YES. [2024-06-27 18:58:25,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80357 conditions, 11725 events. 7361/11725 cut-off events. For 366666/366666 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 80956 event pairs, 1798 based on Foata normal form. 2/11454 useless extension candidates. Maximal degree in co-relation 80202. Up to 10422 conditions per place. [2024-06-27 18:58:25,206 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 455 selfloop transitions, 31 changer transitions 0/495 dead transitions. [2024-06-27 18:58:25,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 495 transitions, 7963 flow [2024-06-27 18:58:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-27 18:58:25,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968944099378882 [2024-06-27 18:58:25,207 INFO L175 Difference]: Start difference. First operand has 317 places, 462 transitions, 6811 flow. Second operand 7 states and 160 transitions. [2024-06-27 18:58:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 495 transitions, 7963 flow [2024-06-27 18:58:26,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 495 transitions, 7884 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:26,215 INFO L231 Difference]: Finished difference. Result has 320 places, 464 transitions, 6846 flow [2024-06-27 18:58:26,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6732, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6846, PETRI_PLACES=320, PETRI_TRANSITIONS=464} [2024-06-27 18:58:26,215 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 268 predicate places. [2024-06-27 18:58:26,215 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 464 transitions, 6846 flow [2024-06-27 18:58:26,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:26,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:26,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:26,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 18:58:26,216 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:26,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -450018014, now seen corresponding path program 8 times [2024-06-27 18:58:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727922059] [2024-06-27 18:58:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727922059] [2024-06-27 18:58:26,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727922059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:26,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:26,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057345489] [2024-06-27 18:58:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:26,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:27,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:27,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 464 transitions, 6846 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:27,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:27,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:27,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:29,350 INFO L124 PetriNetUnfolderBase]: 7365/11575 cut-off events. [2024-06-27 18:58:29,351 INFO L125 PetriNetUnfolderBase]: For 373041/373041 co-relation queries the response was YES. [2024-06-27 18:58:29,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80529 conditions, 11575 events. 7365/11575 cut-off events. For 373041/373041 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 77990 event pairs, 1707 based on Foata normal form. 2/11368 useless extension candidates. Maximal degree in co-relation 80373. Up to 10278 conditions per place. [2024-06-27 18:58:29,524 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 440 selfloop transitions, 63 changer transitions 0/512 dead transitions. [2024-06-27 18:58:29,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 512 transitions, 8188 flow [2024-06-27 18:58:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:58:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:58:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 18:58:29,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054347826086957 [2024-06-27 18:58:29,525 INFO L175 Difference]: Start difference. First operand has 320 places, 464 transitions, 6846 flow. Second operand 8 states and 186 transitions. [2024-06-27 18:58:29,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 512 transitions, 8188 flow [2024-06-27 18:58:30,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 512 transitions, 8059 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:30,616 INFO L231 Difference]: Finished difference. Result has 325 places, 471 transitions, 7013 flow [2024-06-27 18:58:30,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6733, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7013, PETRI_PLACES=325, PETRI_TRANSITIONS=471} [2024-06-27 18:58:30,617 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 273 predicate places. [2024-06-27 18:58:30,617 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 471 transitions, 7013 flow [2024-06-27 18:58:30,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:30,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:30,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:30,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 18:58:30,617 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:30,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 399617197, now seen corresponding path program 1 times [2024-06-27 18:58:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:30,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276082320] [2024-06-27 18:58:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276082320] [2024-06-27 18:58:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276082320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:58:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411391750] [2024-06-27 18:58:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:58:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:58:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:58:30,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-06-27 18:58:30,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 471 transitions, 7013 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:30,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:30,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-06-27 18:58:30,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:32,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([348] L787-->L794: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_73 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_63)) v_~x~0_62) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_73) v_~x$w_buff1_used~0_72) (= (ite .cse0 0 v_~x$w_buff0_used~0_80) v_~x$w_buff0_used~0_79) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_72 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][728], [Black: 257#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 770#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 514#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 84#true, Black: 1030#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 784#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 231#true, Black: 277#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 530#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 272#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 96#true, 21#L794true, 45#L19-5true, Black: 1045#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 543#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 544#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 799#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 290#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), 938#true, Black: 1061#(and (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1062#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 4#L763true, Black: 813#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 558#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork1InUse, Black: 559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 816#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork0InUse, 872#true, 199#true, P1Thread1of1ForFork2InUse, Black: 1078#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 830#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 827#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 831#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 324#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 829#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1091#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1088#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 807#true, Black: 588#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 848#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 847#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 865#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 864#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 507#true, Black: 881#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 856#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 383#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 899#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 131#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 985#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 652#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 776#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 911#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 409#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1082#true, 1102#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 156#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 161#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 669#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 463#true, 16#L807true, Black: 931#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 425#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 173#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 944#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 350#true, Black: 703#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 963#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 455#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 964#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 457#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 453#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 208#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 206#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 693#true, Black: 979#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 180#true, Black: 470#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 728#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 225#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 485#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 447#true, Black: 742#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 994#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 822#true, 536#true, Black: 240#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 239#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1011#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1012#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 18:58:32,660 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 18:58:32,660 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:58:32,660 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:58:32,660 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:58:32,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and .cse5 (= (mod v_~x$w_buff1_used~0_57 256) 0))) (.cse3 (and .cse10 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_62 256) 0))) (let ((.cse7 (or .cse1 .cse3 .cse11)) (.cse8 (and .cse6 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= 0 (mod v_~x$w_buff1_used~0_56 256))) (.cse2 (= (mod v_~x$w_buff0_used~0_61 256) 0))) (and (= v_~x$w_buff1_used~0_56 (ite .cse0 v_~x$w_buff1_used~0_57 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_57 0))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$flush_delayed~0_39 0) (= (ite .cse0 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~x$r_buff0_thd1~0_50 (ite (and .cse6 (not .cse2)) 0 v_~x$r_buff0_thd1~0_50))) v_~x$r_buff0_thd1~0_49) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse7 v_~x~0_59 (ite .cse8 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (= (ite .cse0 v_~x$w_buff0_used~0_62 (ite .cse7 v_~x$w_buff0_used~0_62 (ite .cse8 0 v_~x$w_buff0_used~0_62))) v_~x$w_buff0_used~0_61) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse4) .cse2)) v_~x$r_buff1_thd1~0_52 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_62} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_61, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][138], [Black: 257#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 770#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 514#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 84#true, Black: 1030#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 784#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 231#true, Black: 277#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 530#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 272#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 96#true, Black: 1045#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 543#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 544#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 799#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1098#true, Black: 290#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), 938#true, Black: 1061#(and (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1062#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 4#L763true, Black: 813#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 558#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork1InUse, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 816#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork0InUse, 872#true, 199#true, P1Thread1of1ForFork2InUse, Black: 1078#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 830#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 827#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 831#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 324#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 829#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1091#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1088#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#L797true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 807#true, Black: 588#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 848#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 847#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 865#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 864#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 507#true, Black: 881#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 856#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 383#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 899#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 131#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 985#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 652#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 776#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 911#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 409#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1082#true, Black: 156#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 161#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 669#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 463#true, Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 16#L807true, Black: 931#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 425#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 173#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 944#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 703#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 350#true, Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 963#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 455#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 964#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 457#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 263#true, Black: 454#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 453#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 208#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 206#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 693#true, Black: 979#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 180#true, Black: 470#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 22#L19-2true, Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 728#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 225#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 447#true, Black: 485#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 742#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 994#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 822#true, 536#true, Black: 240#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 239#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1011#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1012#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 18:58:32,829 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-27 18:58:32,829 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:58:32,829 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:58:32,829 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:58:32,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([348] L787-->L794: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_73 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_63)) v_~x~0_62) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_73) v_~x$w_buff1_used~0_72) (= (ite .cse0 0 v_~x$w_buff0_used~0_80) v_~x$w_buff0_used~0_79) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_72 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][728], [Black: 257#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 770#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 514#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 84#true, Black: 1030#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 784#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 231#true, Black: 277#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 530#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 272#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 96#true, 21#L794true, 45#L19-5true, Black: 1045#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 543#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 544#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 799#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 290#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), 938#true, Black: 1061#(and (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1062#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 10#L768true, Black: 813#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 558#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork1InUse, Black: 559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 816#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork0InUse, 872#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 199#true, P1Thread1of1ForFork2InUse, Black: 1078#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 830#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 827#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 831#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 829#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 324#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1091#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1088#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 807#true, Black: 588#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 848#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 847#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 865#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 864#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 507#true, Black: 881#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 856#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 383#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 899#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 131#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 985#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 652#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 776#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 911#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 409#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1082#true, 1102#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 156#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 161#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 669#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 463#true, 16#L807true, Black: 931#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 425#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 173#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 944#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 350#true, Black: 703#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 963#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 455#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 964#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 457#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 453#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 208#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 206#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 693#true, Black: 979#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 180#true, Black: 470#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 728#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 225#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 485#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 447#true, Black: 742#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 994#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 822#true, 536#true, Black: 240#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 239#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1011#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1012#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 18:58:32,927 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 18:58:32,927 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:58:32,927 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:58:32,927 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:58:32,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and .cse5 (= (mod v_~x$w_buff1_used~0_57 256) 0))) (.cse3 (and .cse10 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_62 256) 0))) (let ((.cse7 (or .cse1 .cse3 .cse11)) (.cse8 (and .cse6 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= 0 (mod v_~x$w_buff1_used~0_56 256))) (.cse2 (= (mod v_~x$w_buff0_used~0_61 256) 0))) (and (= v_~x$w_buff1_used~0_56 (ite .cse0 v_~x$w_buff1_used~0_57 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_57 0))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$flush_delayed~0_39 0) (= (ite .cse0 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~x$r_buff0_thd1~0_50 (ite (and .cse6 (not .cse2)) 0 v_~x$r_buff0_thd1~0_50))) v_~x$r_buff0_thd1~0_49) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse7 v_~x~0_59 (ite .cse8 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (= (ite .cse0 v_~x$w_buff0_used~0_62 (ite .cse7 v_~x$w_buff0_used~0_62 (ite .cse8 0 v_~x$w_buff0_used~0_62))) v_~x$w_buff0_used~0_61) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse4) .cse2)) v_~x$r_buff1_thd1~0_52 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_62} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_61, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][591], [Black: 257#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 770#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 514#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 84#true, Black: 1030#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 784#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 231#true, Black: 277#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 530#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 272#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 96#true, 45#L19-5true, Black: 1045#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 543#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 799#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 544#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 290#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), 938#true, Black: 1061#(and (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1062#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 4#L763true, Black: 813#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 558#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork1InUse, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 816#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork0InUse, 872#true, 199#true, P1Thread1of1ForFork2InUse, Black: 1078#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 830#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 574#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 827#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 831#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 324#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 829#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1091#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1088#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#L797true, 807#true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 848#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 847#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 865#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 864#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 507#true, Black: 881#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 856#true, Black: 635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 383#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 899#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 131#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 985#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 652#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 776#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 911#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1102#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 409#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1082#true, Black: 156#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 161#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 669#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 463#true, 16#L807true, Black: 931#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 425#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 173#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 944#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 703#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 350#true, Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0) (= ~x$mem_tmp~0 1)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 963#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 964#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 455#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 457#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 263#true, Black: 454#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 453#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 208#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 206#(and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 693#true, Black: 979#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 180#true, Black: 470#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 728#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 225#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 447#true, Black: 485#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 742#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 994#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 822#true, 536#true, Black: 240#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 239#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1011#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1012#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 18:58:32,940 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-06-27 18:58:32,940 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-06-27 18:58:32,940 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-06-27 18:58:32,940 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-06-27 18:58:33,133 INFO L124 PetriNetUnfolderBase]: 7311/12172 cut-off events. [2024-06-27 18:58:33,133 INFO L125 PetriNetUnfolderBase]: For 301404/303960 co-relation queries the response was YES. [2024-06-27 18:58:33,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76650 conditions, 12172 events. 7311/12172 cut-off events. For 301404/303960 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 94970 event pairs, 1480 based on Foata normal form. 866/12102 useless extension candidates. Maximal degree in co-relation 76493. Up to 4914 conditions per place. [2024-06-27 18:58:33,324 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 266 selfloop transitions, 64 changer transitions 136/773 dead transitions. [2024-06-27 18:58:33,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 773 transitions, 12517 flow [2024-06-27 18:58:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:58:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:58:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 231 transitions. [2024-06-27 18:58:33,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6277173913043478 [2024-06-27 18:58:33,325 INFO L175 Difference]: Start difference. First operand has 325 places, 471 transitions, 7013 flow. Second operand 8 states and 231 transitions. [2024-06-27 18:58:33,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 773 transitions, 12517 flow [2024-06-27 18:58:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 773 transitions, 12295 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-06-27 18:58:34,415 INFO L231 Difference]: Finished difference. Result has 333 places, 493 transitions, 7491 flow [2024-06-27 18:58:34,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6871, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7491, PETRI_PLACES=333, PETRI_TRANSITIONS=493} [2024-06-27 18:58:34,415 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 281 predicate places. [2024-06-27 18:58:34,415 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 493 transitions, 7491 flow [2024-06-27 18:58:34,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:34,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:34,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:34,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 18:58:34,416 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:34,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1065131862, now seen corresponding path program 1 times [2024-06-27 18:58:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810302538] [2024-06-27 18:58:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:35,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810302538] [2024-06-27 18:58:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810302538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:35,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:58:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999037249] [2024-06-27 18:58:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:35,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:58:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:58:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:58:35,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:35,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 493 transitions, 7491 flow. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:35,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:35,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:35,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:38,492 INFO L124 PetriNetUnfolderBase]: 8887/14009 cut-off events. [2024-06-27 18:58:38,492 INFO L125 PetriNetUnfolderBase]: For 417422/417422 co-relation queries the response was YES. [2024-06-27 18:58:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98998 conditions, 14009 events. 8887/14009 cut-off events. For 417422/417422 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 97080 event pairs, 2339 based on Foata normal form. 2/13967 useless extension candidates. Maximal degree in co-relation 98837. Up to 12510 conditions per place. [2024-06-27 18:58:38,701 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 521 selfloop transitions, 75 changer transitions 32/638 dead transitions. [2024-06-27 18:58:38,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 638 transitions, 10211 flow [2024-06-27 18:58:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:58:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:58:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 285 transitions. [2024-06-27 18:58:38,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-27 18:58:38,702 INFO L175 Difference]: Start difference. First operand has 333 places, 493 transitions, 7491 flow. Second operand 12 states and 285 transitions. [2024-06-27 18:58:38,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 638 transitions, 10211 flow [2024-06-27 18:58:40,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 638 transitions, 10211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:58:40,152 INFO L231 Difference]: Finished difference. Result has 349 places, 524 transitions, 8071 flow [2024-06-27 18:58:40,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7491, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8071, PETRI_PLACES=349, PETRI_TRANSITIONS=524} [2024-06-27 18:58:40,152 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 297 predicate places. [2024-06-27 18:58:40,152 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 524 transitions, 8071 flow [2024-06-27 18:58:40,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:40,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:40,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:40,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 18:58:40,153 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:40,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash -217531260, now seen corresponding path program 2 times [2024-06-27 18:58:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058589828] [2024-06-27 18:58:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058589828] [2024-06-27 18:58:41,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058589828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:41,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620928138] [2024-06-27 18:58:41,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:41,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:41,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:41,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:41,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 524 transitions, 8071 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:41,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:41,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:41,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:43,819 INFO L124 PetriNetUnfolderBase]: 7548/11834 cut-off events. [2024-06-27 18:58:43,819 INFO L125 PetriNetUnfolderBase]: For 415386/415392 co-relation queries the response was YES. [2024-06-27 18:58:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88542 conditions, 11834 events. 7548/11834 cut-off events. For 415386/415392 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 79286 event pairs, 1441 based on Foata normal form. 5/11805 useless extension candidates. Maximal degree in co-relation 88373. Up to 10137 conditions per place. [2024-06-27 18:58:44,006 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 462 selfloop transitions, 118 changer transitions 0/590 dead transitions. [2024-06-27 18:58:44,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 590 transitions, 10118 flow [2024-06-27 18:58:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:58:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:58:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 18:58:44,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135869565217391 [2024-06-27 18:58:44,007 INFO L175 Difference]: Start difference. First operand has 349 places, 524 transitions, 8071 flow. Second operand 8 states and 189 transitions. [2024-06-27 18:58:44,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 590 transitions, 10118 flow [2024-06-27 18:58:46,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 590 transitions, 9719 flow, removed 155 selfloop flow, removed 8 redundant places. [2024-06-27 18:58:46,082 INFO L231 Difference]: Finished difference. Result has 347 places, 548 transitions, 8490 flow [2024-06-27 18:58:46,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7816, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8490, PETRI_PLACES=347, PETRI_TRANSITIONS=548} [2024-06-27 18:58:46,083 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 295 predicate places. [2024-06-27 18:58:46,083 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 548 transitions, 8490 flow [2024-06-27 18:58:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:46,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:46,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:46,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 18:58:46,083 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:46,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -92969772, now seen corresponding path program 3 times [2024-06-27 18:58:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805213776] [2024-06-27 18:58:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805213776] [2024-06-27 18:58:47,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805213776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:47,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:47,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808675903] [2024-06-27 18:58:47,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:47,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:47,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:47,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:47,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:47,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:47,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 548 transitions, 8490 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:47,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:47,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:47,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:50,128 INFO L124 PetriNetUnfolderBase]: 7732/11815 cut-off events. [2024-06-27 18:58:50,128 INFO L125 PetriNetUnfolderBase]: For 437309/437315 co-relation queries the response was YES. [2024-06-27 18:58:50,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91806 conditions, 11815 events. 7732/11815 cut-off events. For 437309/437315 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 76437 event pairs, 1302 based on Foata normal form. 5/11790 useless extension candidates. Maximal degree in co-relation 91639. Up to 10097 conditions per place. [2024-06-27 18:58:50,308 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 416 selfloop transitions, 188 changer transitions 0/614 dead transitions. [2024-06-27 18:58:50,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 614 transitions, 10600 flow [2024-06-27 18:58:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:58:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:58:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-27 18:58:50,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-06-27 18:58:50,309 INFO L175 Difference]: Start difference. First operand has 347 places, 548 transitions, 8490 flow. Second operand 7 states and 170 transitions. [2024-06-27 18:58:50,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 614 transitions, 10600 flow [2024-06-27 18:58:51,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 614 transitions, 10424 flow, removed 58 selfloop flow, removed 4 redundant places. [2024-06-27 18:58:51,854 INFO L231 Difference]: Finished difference. Result has 351 places, 575 transitions, 9388 flow [2024-06-27 18:58:51,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8320, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9388, PETRI_PLACES=351, PETRI_TRANSITIONS=575} [2024-06-27 18:58:51,854 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 299 predicate places. [2024-06-27 18:58:51,854 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 575 transitions, 9388 flow [2024-06-27 18:58:51,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:51,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:51,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:51,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 18:58:51,855 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:51,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash -92963262, now seen corresponding path program 4 times [2024-06-27 18:58:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118195018] [2024-06-27 18:58:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118195018] [2024-06-27 18:58:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118195018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138505496] [2024-06-27 18:58:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:52,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:52,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:52,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 575 transitions, 9388 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:52,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:52,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:52,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:58:55,842 INFO L124 PetriNetUnfolderBase]: 7720/12035 cut-off events. [2024-06-27 18:58:55,842 INFO L125 PetriNetUnfolderBase]: For 443990/443996 co-relation queries the response was YES. [2024-06-27 18:58:55,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94106 conditions, 12035 events. 7720/12035 cut-off events. For 443990/443996 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 80478 event pairs, 1884 based on Foata normal form. 5/11982 useless extension candidates. Maximal degree in co-relation 93937. Up to 10826 conditions per place. [2024-06-27 18:58:56,044 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 536 selfloop transitions, 51 changer transitions 0/597 dead transitions. [2024-06-27 18:58:56,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 597 transitions, 10684 flow [2024-06-27 18:58:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:58:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:58:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-27 18:58:56,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:58:56,045 INFO L175 Difference]: Start difference. First operand has 351 places, 575 transitions, 9388 flow. Second operand 6 states and 138 transitions. [2024-06-27 18:58:56,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 597 transitions, 10684 flow [2024-06-27 18:58:57,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 597 transitions, 10324 flow, removed 122 selfloop flow, removed 6 redundant places. [2024-06-27 18:58:57,749 INFO L231 Difference]: Finished difference. Result has 351 places, 575 transitions, 9151 flow [2024-06-27 18:58:57,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9028, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9151, PETRI_PLACES=351, PETRI_TRANSITIONS=575} [2024-06-27 18:58:57,750 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 299 predicate places. [2024-06-27 18:58:57,750 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 575 transitions, 9151 flow [2024-06-27 18:58:57,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:57,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:58:57,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:58:57,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 18:58:57,750 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:58:57,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:58:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -829788331, now seen corresponding path program 1 times [2024-06-27 18:58:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:58:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215367382] [2024-06-27 18:58:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:58:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:58:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:58:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:58:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:58:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215367382] [2024-06-27 18:58:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215367382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:58:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:58:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:58:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839287300] [2024-06-27 18:58:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:58:58,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:58:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:58:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:58:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:58:58,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:58:58,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 575 transitions, 9151 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:58:58,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:58:58,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:58:58,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:02,058 INFO L124 PetriNetUnfolderBase]: 7848/12283 cut-off events. [2024-06-27 18:59:02,058 INFO L125 PetriNetUnfolderBase]: For 424908/424914 co-relation queries the response was YES. [2024-06-27 18:59:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92956 conditions, 12283 events. 7848/12283 cut-off events. For 424908/424914 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 82635 event pairs, 1571 based on Foata normal form. 9/12232 useless extension candidates. Maximal degree in co-relation 92787. Up to 10442 conditions per place. [2024-06-27 18:59:02,232 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 548 selfloop transitions, 71 changer transitions 0/629 dead transitions. [2024-06-27 18:59:02,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 629 transitions, 10903 flow [2024-06-27 18:59:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:59:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:59:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 18:59:02,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190217391304348 [2024-06-27 18:59:02,233 INFO L175 Difference]: Start difference. First operand has 351 places, 575 transitions, 9151 flow. Second operand 8 states and 191 transitions. [2024-06-27 18:59:02,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 629 transitions, 10903 flow [2024-06-27 18:59:03,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 629 transitions, 10770 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 18:59:03,663 INFO L231 Difference]: Finished difference. Result has 356 places, 581 transitions, 9278 flow [2024-06-27 18:59:03,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9020, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9278, PETRI_PLACES=356, PETRI_TRANSITIONS=581} [2024-06-27 18:59:03,664 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 304 predicate places. [2024-06-27 18:59:03,664 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 581 transitions, 9278 flow [2024-06-27 18:59:03,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:03,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:03,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:03,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 18:59:03,664 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:03,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -88594339, now seen corresponding path program 2 times [2024-06-27 18:59:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897266593] [2024-06-27 18:59:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897266593] [2024-06-27 18:59:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897266593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049598280] [2024-06-27 18:59:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:04,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:04,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 581 transitions, 9278 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:04,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:04,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:04,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:07,879 INFO L124 PetriNetUnfolderBase]: 7830/12281 cut-off events. [2024-06-27 18:59:07,879 INFO L125 PetriNetUnfolderBase]: For 411559/411565 co-relation queries the response was YES. [2024-06-27 18:59:08,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92604 conditions, 12281 events. 7830/12281 cut-off events. For 411559/411565 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 82763 event pairs, 1561 based on Foata normal form. 9/12230 useless extension candidates. Maximal degree in co-relation 92433. Up to 10434 conditions per place. [2024-06-27 18:59:08,233 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 541 selfloop transitions, 71 changer transitions 0/622 dead transitions. [2024-06-27 18:59:08,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 622 transitions, 10801 flow [2024-06-27 18:59:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:59:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:59:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-27 18:59:08,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-06-27 18:59:08,234 INFO L175 Difference]: Start difference. First operand has 356 places, 581 transitions, 9278 flow. Second operand 7 states and 170 transitions. [2024-06-27 18:59:08,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 622 transitions, 10801 flow [2024-06-27 18:59:09,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 622 transitions, 10676 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 18:59:09,529 INFO L231 Difference]: Finished difference. Result has 359 places, 581 transitions, 9303 flow [2024-06-27 18:59:09,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9153, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9303, PETRI_PLACES=359, PETRI_TRANSITIONS=581} [2024-06-27 18:59:09,530 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 307 predicate places. [2024-06-27 18:59:09,530 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 581 transitions, 9303 flow [2024-06-27 18:59:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:09,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:09,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:09,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 18:59:09,530 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:09,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1455911209, now seen corresponding path program 1 times [2024-06-27 18:59:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266981426] [2024-06-27 18:59:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266981426] [2024-06-27 18:59:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266981426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667968138] [2024-06-27 18:59:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:10,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:10,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 581 transitions, 9303 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:10,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:10,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:10,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:13,386 INFO L124 PetriNetUnfolderBase]: 8120/12793 cut-off events. [2024-06-27 18:59:13,386 INFO L125 PetriNetUnfolderBase]: For 426834/426843 co-relation queries the response was YES. [2024-06-27 18:59:13,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96888 conditions, 12793 events. 8120/12793 cut-off events. For 426834/426843 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 87242 event pairs, 1624 based on Foata normal form. 10/12781 useless extension candidates. Maximal degree in co-relation 96716. Up to 10709 conditions per place. [2024-06-27 18:59:13,742 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 542 selfloop transitions, 103 changer transitions 0/655 dead transitions. [2024-06-27 18:59:13,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 655 transitions, 11563 flow [2024-06-27 18:59:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:59:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:59:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-27 18:59:13,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193236714975845 [2024-06-27 18:59:13,743 INFO L175 Difference]: Start difference. First operand has 359 places, 581 transitions, 9303 flow. Second operand 9 states and 215 transitions. [2024-06-27 18:59:13,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 655 transitions, 11563 flow [2024-06-27 18:59:15,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 655 transitions, 11366 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 18:59:15,128 INFO L231 Difference]: Finished difference. Result has 363 places, 603 transitions, 9898 flow [2024-06-27 18:59:15,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9108, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9898, PETRI_PLACES=363, PETRI_TRANSITIONS=603} [2024-06-27 18:59:15,128 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 311 predicate places. [2024-06-27 18:59:15,128 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 603 transitions, 9898 flow [2024-06-27 18:59:15,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:15,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:15,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:15,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 18:59:15,129 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:15,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1459630279, now seen corresponding path program 2 times [2024-06-27 18:59:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255319744] [2024-06-27 18:59:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255319744] [2024-06-27 18:59:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255319744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:15,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305264950] [2024-06-27 18:59:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:16,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:16,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 603 transitions, 9898 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:16,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:16,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:16,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:19,319 INFO L124 PetriNetUnfolderBase]: 8268/12942 cut-off events. [2024-06-27 18:59:19,319 INFO L125 PetriNetUnfolderBase]: For 453215/453224 co-relation queries the response was YES. [2024-06-27 18:59:19,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100324 conditions, 12942 events. 8268/12942 cut-off events. For 453215/453224 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 87785 event pairs, 1643 based on Foata normal form. 10/12919 useless extension candidates. Maximal degree in co-relation 100151. Up to 11209 conditions per place. [2024-06-27 18:59:19,533 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 572 selfloop transitions, 76 changer transitions 0/658 dead transitions. [2024-06-27 18:59:19,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 658 transitions, 11852 flow [2024-06-27 18:59:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:59:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:59:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 18:59:19,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2024-06-27 18:59:19,534 INFO L175 Difference]: Start difference. First operand has 363 places, 603 transitions, 9898 flow. Second operand 9 states and 213 transitions. [2024-06-27 18:59:19,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 658 transitions, 11852 flow [2024-06-27 18:59:21,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 658 transitions, 11669 flow, removed 58 selfloop flow, removed 5 redundant places. [2024-06-27 18:59:21,226 INFO L231 Difference]: Finished difference. Result has 368 places, 611 transitions, 10105 flow [2024-06-27 18:59:21,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9741, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10105, PETRI_PLACES=368, PETRI_TRANSITIONS=611} [2024-06-27 18:59:21,227 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 316 predicate places. [2024-06-27 18:59:21,227 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 611 transitions, 10105 flow [2024-06-27 18:59:21,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:21,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:21,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:21,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 18:59:21,228 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:21,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1459635859, now seen corresponding path program 3 times [2024-06-27 18:59:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656835169] [2024-06-27 18:59:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656835169] [2024-06-27 18:59:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656835169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434938420] [2024-06-27 18:59:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:21,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:21,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:22,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:22,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 611 transitions, 10105 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:22,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:22,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:25,608 INFO L124 PetriNetUnfolderBase]: 8256/12920 cut-off events. [2024-06-27 18:59:25,608 INFO L125 PetriNetUnfolderBase]: For 441552/441561 co-relation queries the response was YES. [2024-06-27 18:59:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99957 conditions, 12920 events. 8256/12920 cut-off events. For 441552/441561 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 87559 event pairs, 1630 based on Foata normal form. 10/12900 useless extension candidates. Maximal degree in co-relation 99782. Up to 11201 conditions per place. [2024-06-27 18:59:26,028 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 578 selfloop transitions, 79 changer transitions 0/667 dead transitions. [2024-06-27 18:59:26,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 667 transitions, 11823 flow [2024-06-27 18:59:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:59:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:59:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 254 transitions. [2024-06-27 18:59:26,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019762845849802 [2024-06-27 18:59:26,029 INFO L175 Difference]: Start difference. First operand has 368 places, 611 transitions, 10105 flow. Second operand 11 states and 254 transitions. [2024-06-27 18:59:26,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 667 transitions, 11823 flow [2024-06-27 18:59:27,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 667 transitions, 11662 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-27 18:59:27,511 INFO L231 Difference]: Finished difference. Result has 373 places, 611 transitions, 10112 flow [2024-06-27 18:59:27,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9944, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10112, PETRI_PLACES=373, PETRI_TRANSITIONS=611} [2024-06-27 18:59:27,512 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 321 predicate places. [2024-06-27 18:59:27,512 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 611 transitions, 10112 flow [2024-06-27 18:59:27,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:27,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:27,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:27,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 18:59:27,512 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:27,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash 57688398, now seen corresponding path program 1 times [2024-06-27 18:59:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925218326] [2024-06-27 18:59:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925218326] [2024-06-27 18:59:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925218326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419329820] [2024-06-27 18:59:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:28,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:28,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:28,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 611 transitions, 10112 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:28,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:28,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:28,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:31,779 INFO L124 PetriNetUnfolderBase]: 8247/12868 cut-off events. [2024-06-27 18:59:31,779 INFO L125 PetriNetUnfolderBase]: For 431457/431463 co-relation queries the response was YES. [2024-06-27 18:59:31,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99598 conditions, 12868 events. 8247/12868 cut-off events. For 431457/431463 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 86948 event pairs, 1896 based on Foata normal form. 4/12813 useless extension candidates. Maximal degree in co-relation 99422. Up to 11369 conditions per place. [2024-06-27 18:59:31,996 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 545 selfloop transitions, 82 changer transitions 0/637 dead transitions. [2024-06-27 18:59:31,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 637 transitions, 11541 flow [2024-06-27 18:59:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:59:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:59:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 18:59:31,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:59:31,997 INFO L175 Difference]: Start difference. First operand has 373 places, 611 transitions, 10112 flow. Second operand 6 states and 141 transitions. [2024-06-27 18:59:31,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 637 transitions, 11541 flow [2024-06-27 18:59:33,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 637 transitions, 11346 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-27 18:59:33,749 INFO L231 Difference]: Finished difference. Result has 371 places, 611 transitions, 10118 flow [2024-06-27 18:59:33,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9917, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10118, PETRI_PLACES=371, PETRI_TRANSITIONS=611} [2024-06-27 18:59:33,750 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 319 predicate places. [2024-06-27 18:59:33,750 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 611 transitions, 10118 flow [2024-06-27 18:59:33,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:33,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:33,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 18:59:33,750 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:33,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash 49348871, now seen corresponding path program 4 times [2024-06-27 18:59:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391086767] [2024-06-27 18:59:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391086767] [2024-06-27 18:59:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391086767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295645920] [2024-06-27 18:59:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:59:34,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 18:59:34,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 611 transitions, 10118 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:34,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:59:34,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 18:59:34,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:59:37,940 INFO L124 PetriNetUnfolderBase]: 8315/12918 cut-off events. [2024-06-27 18:59:37,940 INFO L125 PetriNetUnfolderBase]: For 443338/443347 co-relation queries the response was YES. [2024-06-27 18:59:38,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100437 conditions, 12918 events. 8315/12918 cut-off events. For 443338/443347 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 86897 event pairs, 1989 based on Foata normal form. 10/12870 useless extension candidates. Maximal degree in co-relation 100260. Up to 11662 conditions per place. [2024-06-27 18:59:38,151 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 596 selfloop transitions, 34 changer transitions 0/640 dead transitions. [2024-06-27 18:59:38,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 640 transitions, 11627 flow [2024-06-27 18:59:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:59:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:59:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 18:59:38,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937888198757764 [2024-06-27 18:59:38,152 INFO L175 Difference]: Start difference. First operand has 371 places, 611 transitions, 10118 flow. Second operand 7 states and 159 transitions. [2024-06-27 18:59:38,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 640 transitions, 11627 flow [2024-06-27 18:59:39,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 640 transitions, 11439 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 18:59:39,730 INFO L231 Difference]: Finished difference. Result has 373 places, 614 transitions, 10093 flow [2024-06-27 18:59:39,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9930, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10093, PETRI_PLACES=373, PETRI_TRANSITIONS=614} [2024-06-27 18:59:39,730 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 321 predicate places. [2024-06-27 18:59:39,730 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 614 transitions, 10093 flow [2024-06-27 18:59:39,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:59:39,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:59:39,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:59:39,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 18:59:39,731 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:59:39,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:59:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 49141481, now seen corresponding path program 5 times [2024-06-27 18:59:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:59:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693955389] [2024-06-27 18:59:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:59:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:59:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:59:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:59:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:59:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693955389] [2024-06-27 18:59:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693955389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:59:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:59:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:59:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218417821] [2024-06-27 18:59:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:59:40,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:59:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:59:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:59:40,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90