./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix028_power.oepc_pso.oepc_rmo.oepc.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/mix028_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix028_power.oepc_pso.oepc_rmo.oepc.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 22:16:46,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:16:46,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:16:46,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:16:46,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:16:46,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:16:46,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:16:46,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:16:46,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:16:46,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:16:46,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:16:46,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:16:46,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:16:46,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:16:46,183 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:16:46,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:16:46,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:16:46,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:16:46,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:16:46,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:16:46,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:16:46,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:16:46,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:16:46,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:16:46,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:16:46,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:16:46,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:16:46,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:16:46,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:16:46,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:16:46,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:16:46,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:16:46,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:16:46,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:16:46,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:16:46,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:16:46,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:16:46,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:16:46,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:16:46,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:16:46,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:16:46,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:16:46,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:16:46,190 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 22:16:46,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:16:46,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:16:46,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:16:46,436 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:16:46,436 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:16:46,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 22:16:46,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:16:46,515 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:16:46,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:16:47,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:16:47,757 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:16:47,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:16:47,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31635ab74/f6a0c3422eb94fefb5e6cec84abd0c44/FLAGbea19ae84 [2024-06-27 22:16:47,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31635ab74/f6a0c3422eb94fefb5e6cec84abd0c44 [2024-06-27 22:16:47,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:16:47,783 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:16:47,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:16:47,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:16:47,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:16:47,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:16:46" (1/2) ... [2024-06-27 22:16:47,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573d7a63 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:16:47, skipping insertion in model container [2024-06-27 22:16:47,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:16:46" (1/2) ... [2024-06-27 22:16:47,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@742fd395 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:16:47, skipping insertion in model container [2024-06-27 22:16:47,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:16:47" (2/2) ... [2024-06-27 22:16:47,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573d7a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:47, skipping insertion in model container [2024-06-27 22:16:47,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:16:47" (2/2) ... [2024-06-27 22:16:47,794 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:16:47,818 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:16:47,819 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:16:47,819 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:16:47,819 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:16:47,819 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:16:47,819 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-27 22:16:47,856 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:16:47,984 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 22:16:48,143 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:16:48,157 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:16:48,190 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:16:48,329 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:16:48,356 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:16:48,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48 WrapperNode [2024-06-27 22:16:48,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:16:48,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:16:48,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:16:48,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:16:48,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,456 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2024-06-27 22:16:48,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:16:48,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:16:48,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:16:48,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:16:48,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,488 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 22:16:48,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:16:48,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:16:48,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:16:48,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:16:48,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (1/1) ... [2024-06-27 22:16:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:16:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:16:48,537 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 22:16:48,544 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 22:16:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:16:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:16:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:16:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:16:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:16:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:16:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:16:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:16:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:16:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:16:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:16:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:16:48,572 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 22:16:48,766 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:16:48,768 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:16:49,290 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:16:49,291 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:16:49,443 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:16:49,443 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:16:49,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:16:49 BoogieIcfgContainer [2024-06-27 22:16:49,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:16:49,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:16:49,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:16:49,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:16:49,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:16:46" (1/4) ... [2024-06-27 22:16:49,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22841338 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:16:49, skipping insertion in model container [2024-06-27 22:16:49,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:16:47" (2/4) ... [2024-06-27 22:16:49,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22841338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:16:49, skipping insertion in model container [2024-06-27 22:16:49,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:16:48" (3/4) ... [2024-06-27 22:16:49,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22841338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:16:49, skipping insertion in model container [2024-06-27 22:16:49,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:16:49" (4/4) ... [2024-06-27 22:16:49,453 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:16:49,465 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:16:49,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:16:49,466 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:16:49,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:16:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:16:49,581 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:16:49,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:16:49,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:16:49,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:16:49,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:16:49,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:16:49,603 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;@5c4f8685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:16:49,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:16:49,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:16:49,606 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:16:49,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:16:49,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:49,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:16:49,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:49,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 351062661, now seen corresponding path program 1 times [2024-06-27 22:16:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333277805] [2024-06-27 22:16:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:51,254 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 22:16:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333277805] [2024-06-27 22:16:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333277805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:51,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:16:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396414007] [2024-06-27 22:16:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:51,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:16:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:16:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:16:51,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:16:51,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 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 22:16:51,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:51,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:16:51,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:52,004 INFO L124 PetriNetUnfolderBase]: 3008/4695 cut-off events. [2024-06-27 22:16:52,005 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 22:16:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 4695 events. 3008/4695 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28408 event pairs, 2491 based on Foata normal form. 139/4503 useless extension candidates. Maximal degree in co-relation 9138. Up to 4334 conditions per place. [2024-06-27 22:16:52,031 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 42 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-06-27 22:16:52,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 225 flow [2024-06-27 22:16:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:16:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:16:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-06-27 22:16:52,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7092198581560284 [2024-06-27 22:16:52,044 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 100 transitions. [2024-06-27 22:16:52,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 225 flow [2024-06-27 22:16:52,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:16:52,050 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 124 flow [2024-06-27 22:16:52,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-27 22:16:52,054 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-06-27 22:16:52,055 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 124 flow [2024-06-27 22:16:52,055 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 22:16:52,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:52,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:52,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:16:52,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:52,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1930490349, now seen corresponding path program 1 times [2024-06-27 22:16:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692958000] [2024-06-27 22:16:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:53,233 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 22:16:53,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692958000] [2024-06-27 22:16:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692958000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:16:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834936834] [2024-06-27 22:16:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:53,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:16:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:16:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:16:53,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:16:53,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 22:16:53,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:53,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:16:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:53,815 INFO L124 PetriNetUnfolderBase]: 3044/4820 cut-off events. [2024-06-27 22:16:53,815 INFO L125 PetriNetUnfolderBase]: For 575/575 co-relation queries the response was YES. [2024-06-27 22:16:53,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10442 conditions, 4820 events. 3044/4820 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 29331 event pairs, 1988 based on Foata normal form. 5/4508 useless extension candidates. Maximal degree in co-relation 10430. Up to 4365 conditions per place. [2024-06-27 22:16:53,840 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-06-27 22:16:53,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 320 flow [2024-06-27 22:16:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:16:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:16:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-06-27 22:16:53,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648936170212766 [2024-06-27 22:16:53,842 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 124 flow. Second operand 4 states and 125 transitions. [2024-06-27 22:16:53,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 320 flow [2024-06-27 22:16:53,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:16:53,846 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 187 flow [2024-06-27 22:16:53,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-27 22:16:53,847 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2024-06-27 22:16:53,847 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 187 flow [2024-06-27 22:16:53,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 22:16:53,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:53,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:53,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:16:53,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:53,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash 284341944, now seen corresponding path program 1 times [2024-06-27 22:16:53,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:53,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688142154] [2024-06-27 22:16:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:54,830 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 22:16:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688142154] [2024-06-27 22:16:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688142154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:16:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250284369] [2024-06-27 22:16:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:16:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:16:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:16:54,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:16:54,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 22:16:54,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:54,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:16:54,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:55,580 INFO L124 PetriNetUnfolderBase]: 3440/5474 cut-off events. [2024-06-27 22:16:55,580 INFO L125 PetriNetUnfolderBase]: For 2286/2296 co-relation queries the response was YES. [2024-06-27 22:16:55,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13250 conditions, 5474 events. 3440/5474 cut-off events. For 2286/2296 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34662 event pairs, 1478 based on Foata normal form. 16/5149 useless extension candidates. Maximal degree in co-relation 13235. Up to 4454 conditions per place. [2024-06-27 22:16:55,605 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 72 selfloop transitions, 19 changer transitions 2/106 dead transitions. [2024-06-27 22:16:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 537 flow [2024-06-27 22:16:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:16:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:16:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-06-27 22:16:55,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7148936170212766 [2024-06-27 22:16:55,610 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 187 flow. Second operand 5 states and 168 transitions. [2024-06-27 22:16:55,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 537 flow [2024-06-27 22:16:55,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 526 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 22:16:55,615 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 312 flow [2024-06-27 22:16:55,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2024-06-27 22:16:55,616 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2024-06-27 22:16:55,616 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 312 flow [2024-06-27 22:16:55,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 22:16:55,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:55,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:55,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:16:55,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:55,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -440268798, now seen corresponding path program 1 times [2024-06-27 22:16:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125050361] [2024-06-27 22:16:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:57,071 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 22:16:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125050361] [2024-06-27 22:16:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125050361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:57,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:57,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:16:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609210362] [2024-06-27 22:16:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:16:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:16:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:16:57,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:16:57,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 22:16:57,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:57,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:16:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:57,983 INFO L124 PetriNetUnfolderBase]: 3446/5128 cut-off events. [2024-06-27 22:16:57,983 INFO L125 PetriNetUnfolderBase]: For 6117/6173 co-relation queries the response was YES. [2024-06-27 22:16:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15940 conditions, 5128 events. 3446/5128 cut-off events. For 6117/6173 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 29372 event pairs, 900 based on Foata normal form. 21/4962 useless extension candidates. Maximal degree in co-relation 15921. Up to 4565 conditions per place. [2024-06-27 22:16:58,012 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 101 selfloop transitions, 28 changer transitions 3/145 dead transitions. [2024-06-27 22:16:58,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 145 transitions, 901 flow [2024-06-27 22:16:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:16:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:16:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-06-27 22:16:58,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2024-06-27 22:16:58,014 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 312 flow. Second operand 6 states and 201 transitions. [2024-06-27 22:16:58,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 145 transitions, 901 flow [2024-06-27 22:16:58,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 145 transitions, 889 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 22:16:58,020 INFO L231 Difference]: Finished difference. Result has 72 places, 88 transitions, 558 flow [2024-06-27 22:16:58,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=558, PETRI_PLACES=72, PETRI_TRANSITIONS=88} [2024-06-27 22:16:58,021 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 22:16:58,021 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 88 transitions, 558 flow [2024-06-27 22:16:58,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 22:16:58,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:58,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:16:58,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:58,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1625277929, now seen corresponding path program 1 times [2024-06-27 22:16:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486367700] [2024-06-27 22:16:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:59,589 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 22:16:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486367700] [2024-06-27 22:16:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486367700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:59,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:59,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:16:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833311228] [2024-06-27 22:16:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:59,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:16:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:16:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:16:59,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:16:59,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 88 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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 22:16:59,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:59,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:16:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:00,581 INFO L124 PetriNetUnfolderBase]: 3620/5406 cut-off events. [2024-06-27 22:17:00,581 INFO L125 PetriNetUnfolderBase]: For 11233/11455 co-relation queries the response was YES. [2024-06-27 22:17:00,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19511 conditions, 5406 events. 3620/5406 cut-off events. For 11233/11455 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31264 event pairs, 677 based on Foata normal form. 50/5269 useless extension candidates. Maximal degree in co-relation 19486. Up to 4541 conditions per place. [2024-06-27 22:17:00,627 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 112 selfloop transitions, 30 changer transitions 4/159 dead transitions. [2024-06-27 22:17:00,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 159 transitions, 1118 flow [2024-06-27 22:17:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:17:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:17:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-06-27 22:17:00,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990881458966566 [2024-06-27 22:17:00,629 INFO L175 Difference]: Start difference. First operand has 72 places, 88 transitions, 558 flow. Second operand 7 states and 230 transitions. [2024-06-27 22:17:00,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 159 transitions, 1118 flow [2024-06-27 22:17:00,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 159 transitions, 1110 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 22:17:00,645 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 632 flow [2024-06-27 22:17:00,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2024-06-27 22:17:00,647 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-06-27 22:17:00,652 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 632 flow [2024-06-27 22:17:00,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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 22:17:00,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:00,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:00,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:17:00,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:00,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 1 times [2024-06-27 22:17:00,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:00,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615548810] [2024-06-27 22:17:00,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:02,107 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 22:17:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615548810] [2024-06-27 22:17:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615548810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:17:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242897273] [2024-06-27 22:17:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:02,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:17:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:17:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:17:02,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:17:02,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 22:17:02,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:02,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:17:02,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:03,184 INFO L124 PetriNetUnfolderBase]: 4090/6572 cut-off events. [2024-06-27 22:17:03,184 INFO L125 PetriNetUnfolderBase]: For 17901/18036 co-relation queries the response was YES. [2024-06-27 22:17:03,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23369 conditions, 6572 events. 4090/6572 cut-off events. For 17901/18036 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 42487 event pairs, 2159 based on Foata normal form. 15/6191 useless extension candidates. Maximal degree in co-relation 23340. Up to 5668 conditions per place. [2024-06-27 22:17:03,232 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 99 selfloop transitions, 19 changer transitions 0/129 dead transitions. [2024-06-27 22:17:03,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 129 transitions, 1027 flow [2024-06-27 22:17:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:17:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:17:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-27 22:17:03,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-06-27 22:17:03,234 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 632 flow. Second operand 6 states and 162 transitions. [2024-06-27 22:17:03,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 129 transitions, 1027 flow [2024-06-27 22:17:03,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 959 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:17:03,247 INFO L231 Difference]: Finished difference. Result has 81 places, 97 transitions, 701 flow [2024-06-27 22:17:03,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=701, PETRI_PLACES=81, PETRI_TRANSITIONS=97} [2024-06-27 22:17:03,250 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2024-06-27 22:17:03,250 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 97 transitions, 701 flow [2024-06-27 22:17:03,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 22:17:03,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:03,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:03,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:17:03,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:03,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1266450565, now seen corresponding path program 1 times [2024-06-27 22:17:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211634892] [2024-06-27 22:17:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:04,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 22:17:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211634892] [2024-06-27 22:17:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211634892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:04,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:04,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:17:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870651369] [2024-06-27 22:17:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:17:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:04,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:17:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:17:04,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:17:04,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 97 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:04,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:04,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:17:04,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:05,889 INFO L124 PetriNetUnfolderBase]: 4218/6881 cut-off events. [2024-06-27 22:17:05,890 INFO L125 PetriNetUnfolderBase]: For 20514/20874 co-relation queries the response was YES. [2024-06-27 22:17:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25175 conditions, 6881 events. 4218/6881 cut-off events. For 20514/20874 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 44571 event pairs, 1521 based on Foata normal form. 28/6565 useless extension candidates. Maximal degree in co-relation 25141. Up to 5893 conditions per place. [2024-06-27 22:17:05,931 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 112 selfloop transitions, 32 changer transitions 0/155 dead transitions. [2024-06-27 22:17:05,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 155 transitions, 1316 flow [2024-06-27 22:17:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:17:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:17:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 22:17:05,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683890577507599 [2024-06-27 22:17:05,933 INFO L175 Difference]: Start difference. First operand has 81 places, 97 transitions, 701 flow. Second operand 7 states and 187 transitions. [2024-06-27 22:17:05,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 155 transitions, 1316 flow [2024-06-27 22:17:05,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 155 transitions, 1296 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 22:17:05,949 INFO L231 Difference]: Finished difference. Result has 89 places, 119 transitions, 955 flow [2024-06-27 22:17:05,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=955, PETRI_PLACES=89, PETRI_TRANSITIONS=119} [2024-06-27 22:17:05,950 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-06-27 22:17:05,950 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 119 transitions, 955 flow [2024-06-27 22:17:05,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:05,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:05,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:05,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:17:05,951 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:05,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash 178064501, now seen corresponding path program 2 times [2024-06-27 22:17:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959092349] [2024-06-27 22:17:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:07,133 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 22:17:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959092349] [2024-06-27 22:17:07,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959092349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:07,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:07,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:17:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856973096] [2024-06-27 22:17:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:07,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:17:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:17:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:17:07,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:17:07,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 119 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:07,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:07,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:17:07,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:08,265 INFO L124 PetriNetUnfolderBase]: 4892/7992 cut-off events. [2024-06-27 22:17:08,266 INFO L125 PetriNetUnfolderBase]: For 28829/29206 co-relation queries the response was YES. [2024-06-27 22:17:08,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31355 conditions, 7992 events. 4892/7992 cut-off events. For 28829/29206 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 53327 event pairs, 2119 based on Foata normal form. 43/7627 useless extension candidates. Maximal degree in co-relation 31316. Up to 6176 conditions per place. [2024-06-27 22:17:08,316 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 148 selfloop transitions, 38 changer transitions 2/199 dead transitions. [2024-06-27 22:17:08,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 199 transitions, 1917 flow [2024-06-27 22:17:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:17:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:17:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-27 22:17:08,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-06-27 22:17:08,318 INFO L175 Difference]: Start difference. First operand has 89 places, 119 transitions, 955 flow. Second operand 6 states and 168 transitions. [2024-06-27 22:17:08,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 199 transitions, 1917 flow [2024-06-27 22:17:08,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 199 transitions, 1818 flow, removed 44 selfloop flow, removed 2 redundant places. [2024-06-27 22:17:08,347 INFO L231 Difference]: Finished difference. Result has 94 places, 144 transitions, 1294 flow [2024-06-27 22:17:08,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1294, PETRI_PLACES=94, PETRI_TRANSITIONS=144} [2024-06-27 22:17:08,348 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2024-06-27 22:17:08,348 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 144 transitions, 1294 flow [2024-06-27 22:17:08,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:08,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:08,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:08,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:17:08,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:08,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash -285483631, now seen corresponding path program 3 times [2024-06-27 22:17:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565722717] [2024-06-27 22:17:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:09,320 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 22:17:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565722717] [2024-06-27 22:17:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565722717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:09,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:17:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276062558] [2024-06-27 22:17:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:09,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:17:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:17:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:17:09,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:17:09,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 144 transitions, 1294 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:09,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:09,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:17:09,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:10,510 INFO L124 PetriNetUnfolderBase]: 4872/8004 cut-off events. [2024-06-27 22:17:10,510 INFO L125 PetriNetUnfolderBase]: For 32635/32886 co-relation queries the response was YES. [2024-06-27 22:17:10,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32473 conditions, 8004 events. 4872/8004 cut-off events. For 32635/32886 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53990 event pairs, 2160 based on Foata normal form. 16/7601 useless extension candidates. Maximal degree in co-relation 32431. Up to 6929 conditions per place. [2024-06-27 22:17:10,573 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 142 selfloop transitions, 19 changer transitions 0/172 dead transitions. [2024-06-27 22:17:10,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 172 transitions, 1736 flow [2024-06-27 22:17:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:17:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:17:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 22:17:10,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-06-27 22:17:10,575 INFO L175 Difference]: Start difference. First operand has 94 places, 144 transitions, 1294 flow. Second operand 6 states and 151 transitions. [2024-06-27 22:17:10,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 172 transitions, 1736 flow [2024-06-27 22:17:10,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 172 transitions, 1725 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 22:17:10,611 INFO L231 Difference]: Finished difference. Result has 99 places, 151 transitions, 1399 flow [2024-06-27 22:17:10,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1399, PETRI_PLACES=99, PETRI_TRANSITIONS=151} [2024-06-27 22:17:10,612 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-06-27 22:17:10,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 1399 flow [2024-06-27 22:17:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 22:17:10,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:10,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:10,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:17:10,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:10,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -244973673, now seen corresponding path program 1 times [2024-06-27 22:17:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:10,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041780756] [2024-06-27 22:17:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:10,757 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 22:17:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041780756] [2024-06-27 22:17:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041780756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:17:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697348408] [2024-06-27 22:17:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:10,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:17:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:17:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:17:10,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2024-06-27 22:17:10,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 1399 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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 22:17:10,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:10,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2024-06-27 22:17:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:11,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_57 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_58 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_47 256) 0)) .cse4))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_47) v_~z$w_buff1_used~0_46) (= v_~z$w_buff0_used~0_57 (ite .cse2 0 v_~z$w_buff0_used~0_58)) (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_46 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25) (= v_~z~0_22 (ite .cse2 v_~z$w_buff0~0_21 (ite .cse1 v_~z$w_buff1~0_18 v_~z~0_23)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_47, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][99], [Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$r_buff0_thd1~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$w_buff0~0 1)), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 107#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), 95#true, Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 69#true, Black: 80#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 22#L786true, 48#$Ultimate##0true, Black: 93#(and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= 1 ~z$r_buff0_thd1~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), 132#true, 77#true, 122#true, Black: 101#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), Black: 99#(or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (<= (* 256 (div ~z$r_buff0_thd1~0 256)) (+ ~__unbuffered_p2_EAX~0 ~z$r_buff0_thd1~0)) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), 5#L763true, 143#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 116#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, 11#L852true, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0))]) [2024-06-27 22:17:11,219 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 22:17:11,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:17:11,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:17:11,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:17:11,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_57 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_58 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_47 256) 0)) .cse4))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_47) v_~z$w_buff1_used~0_46) (= v_~z$w_buff0_used~0_57 (ite .cse2 0 v_~z$w_buff0_used~0_58)) (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_46 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25) (= v_~z~0_22 (ite .cse2 v_~z$w_buff0~0_21 (ite .cse1 v_~z$w_buff1~0_18 v_~z~0_23)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_47, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][99], [Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$r_buff0_thd1~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$w_buff0~0 1)), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 107#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), 95#true, Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 69#true, Black: 80#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 22#L786true, 48#$Ultimate##0true, Black: 93#(and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= 1 ~z$r_buff0_thd1~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), 132#true, 77#true, 122#true, Black: 101#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), 41#L18-1true, Black: 99#(or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (<= (* 256 (div ~z$r_buff0_thd1~0 256)) (+ ~__unbuffered_p2_EAX~0 ~z$r_buff0_thd1~0)) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), 5#L763true, 143#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 116#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0))]) [2024-06-27 22:17:11,319 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 22:17:11,319 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:17:11,319 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:17:11,319 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:17:11,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_57 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_58 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_47 256) 0)) .cse4))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_47) v_~z$w_buff1_used~0_46) (= v_~z$w_buff0_used~0_57 (ite .cse2 0 v_~z$w_buff0_used~0_58)) (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_46 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25) (= v_~z~0_22 (ite .cse2 v_~z$w_buff0~0_21 (ite .cse1 v_~z$w_buff1~0_18 v_~z~0_23)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_47, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][99], [Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$r_buff0_thd1~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$w_buff0~0 1)), Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 2#ULTIMATE.startEXITtrue, 107#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0)), 95#true, Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 69#true, Black: 80#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), 22#L786true, 48#$Ultimate##0true, Black: 93#(and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0) (+ ~z$w_buff0_used~0 1)) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= 1 ~z$r_buff0_thd1~0) (<= (* 256 (div ~z$w_buff0_used~0 256)) (+ ~z$w_buff0_used~0 ~__unbuffered_p2_EAX~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) ~z$w_buff0_used~0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1)), 132#true, 122#true, 77#true, Black: 101#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), Black: 99#(or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (<= (* 256 (div ~z$r_buff0_thd1~0 256)) (+ ~__unbuffered_p2_EAX~0 ~z$r_buff0_thd1~0)) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0)), 5#L763true, 143#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 116#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0))]) [2024-06-27 22:17:11,390 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 22:17:11,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:17:11,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:17:11,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:17:11,502 INFO L124 PetriNetUnfolderBase]: 2840/5334 cut-off events. [2024-06-27 22:17:11,502 INFO L125 PetriNetUnfolderBase]: For 20002/20881 co-relation queries the response was YES. [2024-06-27 22:17:11,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19733 conditions, 5334 events. 2840/5334 cut-off events. For 20002/20881 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 41221 event pairs, 1141 based on Foata normal form. 350/5213 useless extension candidates. Maximal degree in co-relation 19688. Up to 3396 conditions per place. [2024-06-27 22:17:11,543 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 82 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2024-06-27 22:17:11,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 162 transitions, 1605 flow [2024-06-27 22:17:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:17:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:17:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 22:17:11,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6968085106382979 [2024-06-27 22:17:11,545 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 1399 flow. Second operand 4 states and 131 transitions. [2024-06-27 22:17:11,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 162 transitions, 1605 flow [2024-06-27 22:17:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1563 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:17:11,568 INFO L231 Difference]: Finished difference. Result has 95 places, 147 transitions, 1345 flow [2024-06-27 22:17:11,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1345, PETRI_PLACES=95, PETRI_TRANSITIONS=147} [2024-06-27 22:17:11,569 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2024-06-27 22:17:11,569 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 147 transitions, 1345 flow [2024-06-27 22:17:11,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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 22:17:11,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:11,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:11,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:17:11,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:11,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1994559790, now seen corresponding path program 1 times [2024-06-27 22:17:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984285267] [2024-06-27 22:17:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:13,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 22:17:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984285267] [2024-06-27 22:17:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984285267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:17:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304681699] [2024-06-27 22:17:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:13,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:17:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:17:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:17:13,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:17:13,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 147 transitions, 1345 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:17:13,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:13,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:17:13,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:15,007 INFO L124 PetriNetUnfolderBase]: 4678/7731 cut-off events. [2024-06-27 22:17:15,007 INFO L125 PetriNetUnfolderBase]: For 32305/32769 co-relation queries the response was YES. [2024-06-27 22:17:15,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30877 conditions, 7731 events. 4678/7731 cut-off events. For 32305/32769 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 51906 event pairs, 1412 based on Foata normal form. 94/7571 useless extension candidates. Maximal degree in co-relation 30834. Up to 4946 conditions per place. [2024-06-27 22:17:15,069 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 128 selfloop transitions, 74 changer transitions 4/219 dead transitions. [2024-06-27 22:17:15,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 219 transitions, 2200 flow [2024-06-27 22:17:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:17:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:17:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-06-27 22:17:15,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6139817629179332 [2024-06-27 22:17:15,071 INFO L175 Difference]: Start difference. First operand has 95 places, 147 transitions, 1345 flow. Second operand 7 states and 202 transitions. [2024-06-27 22:17:15,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 219 transitions, 2200 flow [2024-06-27 22:17:15,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 219 transitions, 2176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:17:15,121 INFO L231 Difference]: Finished difference. Result has 102 places, 165 transitions, 1780 flow [2024-06-27 22:17:15,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1780, PETRI_PLACES=102, PETRI_TRANSITIONS=165} [2024-06-27 22:17:15,122 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-27 22:17:15,122 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 165 transitions, 1780 flow [2024-06-27 22:17:15,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:17:15,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:15,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:15,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:17:15,124 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:15,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash -259780455, now seen corresponding path program 1 times [2024-06-27 22:17:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470185552] [2024-06-27 22:17:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:17,165 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 22:17:17,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:17,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470185552] [2024-06-27 22:17:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470185552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144687525] [2024-06-27 22:17:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:17,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:17,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:17,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:17,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 165 transitions, 1780 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:17,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:17,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:17,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:19,266 INFO L124 PetriNetUnfolderBase]: 8752/13742 cut-off events. [2024-06-27 22:17:19,266 INFO L125 PetriNetUnfolderBase]: For 77984/77984 co-relation queries the response was YES. [2024-06-27 22:17:19,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61228 conditions, 13742 events. 8752/13742 cut-off events. For 77984/77984 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 92299 event pairs, 3989 based on Foata normal form. 20/13434 useless extension candidates. Maximal degree in co-relation 61181. Up to 11831 conditions per place. [2024-06-27 22:17:19,359 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 217 selfloop transitions, 28 changer transitions 0/253 dead transitions. [2024-06-27 22:17:19,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 253 transitions, 2889 flow [2024-06-27 22:17:19,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:17:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:17:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-06-27 22:17:19,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846335697399527 [2024-06-27 22:17:19,362 INFO L175 Difference]: Start difference. First operand has 102 places, 165 transitions, 1780 flow. Second operand 9 states and 205 transitions. [2024-06-27 22:17:19,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 253 transitions, 2889 flow [2024-06-27 22:17:19,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 253 transitions, 2831 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-06-27 22:17:19,493 INFO L231 Difference]: Finished difference. Result has 113 places, 190 transitions, 2120 flow [2024-06-27 22:17:19,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2120, PETRI_PLACES=113, PETRI_TRANSITIONS=190} [2024-06-27 22:17:19,493 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2024-06-27 22:17:19,494 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 190 transitions, 2120 flow [2024-06-27 22:17:19,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:19,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:19,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:19,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:17:19,494 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:19,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2056091298, now seen corresponding path program 2 times [2024-06-27 22:17:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:19,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415330862] [2024-06-27 22:17:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:21,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 22:17:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415330862] [2024-06-27 22:17:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415330862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:17:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132279283] [2024-06-27 22:17:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:17:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:17:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:17:21,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:17:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 190 transitions, 2120 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:17:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:17:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:22,397 INFO L124 PetriNetUnfolderBase]: 5312/8338 cut-off events. [2024-06-27 22:17:22,397 INFO L125 PetriNetUnfolderBase]: For 53693/54325 co-relation queries the response was YES. [2024-06-27 22:17:22,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41031 conditions, 8338 events. 5312/8338 cut-off events. For 53693/54325 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 54447 event pairs, 1075 based on Foata normal form. 95/8176 useless extension candidates. Maximal degree in co-relation 40977. Up to 6528 conditions per place. [2024-06-27 22:17:22,469 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 158 selfloop transitions, 65 changer transitions 0/243 dead transitions. [2024-06-27 22:17:22,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 243 transitions, 2888 flow [2024-06-27 22:17:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:17:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:17:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-06-27 22:17:22,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896656534954408 [2024-06-27 22:17:22,472 INFO L175 Difference]: Start difference. First operand has 113 places, 190 transitions, 2120 flow. Second operand 7 states and 194 transitions. [2024-06-27 22:17:22,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 243 transitions, 2888 flow [2024-06-27 22:17:22,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 243 transitions, 2861 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:17:22,550 INFO L231 Difference]: Finished difference. Result has 119 places, 198 transitions, 2331 flow [2024-06-27 22:17:22,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2331, PETRI_PLACES=119, PETRI_TRANSITIONS=198} [2024-06-27 22:17:22,551 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2024-06-27 22:17:22,551 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 198 transitions, 2331 flow [2024-06-27 22:17:22,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 22:17:22,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:22,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:22,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:17:22,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:22,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 995214834, now seen corresponding path program 1 times [2024-06-27 22:17:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:22,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166576489] [2024-06-27 22:17:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:23,868 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 22:17:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166576489] [2024-06-27 22:17:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166576489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192362102] [2024-06-27 22:17:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:23,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:23,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 198 transitions, 2331 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:23,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:23,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:25,958 INFO L124 PetriNetUnfolderBase]: 8949/14029 cut-off events. [2024-06-27 22:17:25,958 INFO L125 PetriNetUnfolderBase]: For 89481/89481 co-relation queries the response was YES. [2024-06-27 22:17:26,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67153 conditions, 14029 events. 8949/14029 cut-off events. For 89481/89481 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 94434 event pairs, 3989 based on Foata normal form. 8/13703 useless extension candidates. Maximal degree in co-relation 67096. Up to 12250 conditions per place. [2024-06-27 22:17:26,080 INFO L140 encePairwiseOnDemand]: 30/47 looper letters, 222 selfloop transitions, 43 changer transitions 0/273 dead transitions. [2024-06-27 22:17:26,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 273 transitions, 3336 flow [2024-06-27 22:17:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:17:26,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 22:17:26,082 INFO L175 Difference]: Start difference. First operand has 119 places, 198 transitions, 2331 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:17:26,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 273 transitions, 3336 flow [2024-06-27 22:17:26,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 273 transitions, 3240 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 22:17:26,246 INFO L231 Difference]: Finished difference. Result has 124 places, 215 transitions, 2542 flow [2024-06-27 22:17:26,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2542, PETRI_PLACES=124, PETRI_TRANSITIONS=215} [2024-06-27 22:17:26,246 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 71 predicate places. [2024-06-27 22:17:26,247 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 215 transitions, 2542 flow [2024-06-27 22:17:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:26,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:26,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:26,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:17:26,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:26,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1440582894, now seen corresponding path program 2 times [2024-06-27 22:17:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596095580] [2024-06-27 22:17:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:27,836 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 22:17:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596095580] [2024-06-27 22:17:27,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596095580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:27,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:27,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731026731] [2024-06-27 22:17:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:27,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:27,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:27,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 215 transitions, 2542 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:27,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:27,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:27,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:30,027 INFO L124 PetriNetUnfolderBase]: 9137/14281 cut-off events. [2024-06-27 22:17:30,028 INFO L125 PetriNetUnfolderBase]: For 94368/94368 co-relation queries the response was YES. [2024-06-27 22:17:30,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72305 conditions, 14281 events. 9137/14281 cut-off events. For 94368/94368 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 95960 event pairs, 4046 based on Foata normal form. 8/13958 useless extension candidates. Maximal degree in co-relation 72246. Up to 12529 conditions per place. [2024-06-27 22:17:30,172 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 246 selfloop transitions, 40 changer transitions 0/294 dead transitions. [2024-06-27 22:17:30,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 294 transitions, 3661 flow [2024-06-27 22:17:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:17:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:17:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-06-27 22:17:30,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728132387706856 [2024-06-27 22:17:30,174 INFO L175 Difference]: Start difference. First operand has 124 places, 215 transitions, 2542 flow. Second operand 9 states and 200 transitions. [2024-06-27 22:17:30,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 294 transitions, 3661 flow [2024-06-27 22:17:30,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 294 transitions, 3551 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-27 22:17:30,362 INFO L231 Difference]: Finished difference. Result has 132 places, 247 transitions, 2961 flow [2024-06-27 22:17:30,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2961, PETRI_PLACES=132, PETRI_TRANSITIONS=247} [2024-06-27 22:17:30,363 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 79 predicate places. [2024-06-27 22:17:30,363 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 247 transitions, 2961 flow [2024-06-27 22:17:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:30,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:30,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:17:30,364 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:30,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 538219542, now seen corresponding path program 3 times [2024-06-27 22:17:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917222153] [2024-06-27 22:17:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:32,118 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 22:17:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917222153] [2024-06-27 22:17:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917222153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307915396] [2024-06-27 22:17:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:32,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:32,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:32,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 247 transitions, 2961 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:32,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:32,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:32,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:34,434 INFO L124 PetriNetUnfolderBase]: 9307/14562 cut-off events. [2024-06-27 22:17:34,435 INFO L125 PetriNetUnfolderBase]: For 107893/107893 co-relation queries the response was YES. [2024-06-27 22:17:34,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76731 conditions, 14562 events. 9307/14562 cut-off events. For 107893/107893 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 98202 event pairs, 4097 based on Foata normal form. 11/14230 useless extension candidates. Maximal degree in co-relation 76667. Up to 12800 conditions per place. [2024-06-27 22:17:34,574 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 265 selfloop transitions, 38 changer transitions 0/311 dead transitions. [2024-06-27 22:17:34,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 311 transitions, 4008 flow [2024-06-27 22:17:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 22:17:34,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-06-27 22:17:34,584 INFO L175 Difference]: Start difference. First operand has 132 places, 247 transitions, 2961 flow. Second operand 8 states and 184 transitions. [2024-06-27 22:17:34,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 311 transitions, 4008 flow [2024-06-27 22:17:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 311 transitions, 3948 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 22:17:34,832 INFO L231 Difference]: Finished difference. Result has 140 places, 267 transitions, 3290 flow [2024-06-27 22:17:34,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3290, PETRI_PLACES=140, PETRI_TRANSITIONS=267} [2024-06-27 22:17:34,833 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-06-27 22:17:34,833 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 267 transitions, 3290 flow [2024-06-27 22:17:34,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 22:17:34,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:34,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:34,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:17:34,834 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:34,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1790464865, now seen corresponding path program 1 times [2024-06-27 22:17:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124853238] [2024-06-27 22:17:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:36,676 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 22:17:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124853238] [2024-06-27 22:17:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124853238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025287301] [2024-06-27 22:17:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:36,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:36,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:36,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:36,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:17:36,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 267 transitions, 3290 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:36,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:36,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:17:36,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:38,778 INFO L124 PetriNetUnfolderBase]: 6739/10937 cut-off events. [2024-06-27 22:17:38,778 INFO L125 PetriNetUnfolderBase]: For 95465/96779 co-relation queries the response was YES. [2024-06-27 22:17:38,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59323 conditions, 10937 events. 6739/10937 cut-off events. For 95465/96779 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 78078 event pairs, 1124 based on Foata normal form. 282/10577 useless extension candidates. Maximal degree in co-relation 59253. Up to 6525 conditions per place. [2024-06-27 22:17:38,873 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 225 selfloop transitions, 76 changer transitions 0/333 dead transitions. [2024-06-27 22:17:38,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 333 transitions, 4362 flow [2024-06-27 22:17:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 22:17:38,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-06-27 22:17:38,875 INFO L175 Difference]: Start difference. First operand has 140 places, 267 transitions, 3290 flow. Second operand 8 states and 226 transitions. [2024-06-27 22:17:38,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 333 transitions, 4362 flow [2024-06-27 22:17:39,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 333 transitions, 4283 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-27 22:17:39,020 INFO L231 Difference]: Finished difference. Result has 145 places, 269 transitions, 3399 flow [2024-06-27 22:17:39,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3211, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3399, PETRI_PLACES=145, PETRI_TRANSITIONS=269} [2024-06-27 22:17:39,020 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2024-06-27 22:17:39,021 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 269 transitions, 3399 flow [2024-06-27 22:17:39,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:39,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:39,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:17:39,021 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:39,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash -695508711, now seen corresponding path program 2 times [2024-06-27 22:17:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401612943] [2024-06-27 22:17:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:41,218 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 22:17:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401612943] [2024-06-27 22:17:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401612943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066597581] [2024-06-27 22:17:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:41,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:41,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:41,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:17:41,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 269 transitions, 3399 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:41,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:41,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:17:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:43,199 INFO L124 PetriNetUnfolderBase]: 7019/11173 cut-off events. [2024-06-27 22:17:43,200 INFO L125 PetriNetUnfolderBase]: For 109136/110757 co-relation queries the response was YES. [2024-06-27 22:17:43,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62658 conditions, 11173 events. 7019/11173 cut-off events. For 109136/110757 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 79030 event pairs, 1483 based on Foata normal form. 325/10868 useless extension candidates. Maximal degree in co-relation 62586. Up to 8031 conditions per place. [2024-06-27 22:17:43,334 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 223 selfloop transitions, 74 changer transitions 0/329 dead transitions. [2024-06-27 22:17:43,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 329 transitions, 4377 flow [2024-06-27 22:17:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2024-06-27 22:17:43,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5904255319148937 [2024-06-27 22:17:43,336 INFO L175 Difference]: Start difference. First operand has 145 places, 269 transitions, 3399 flow. Second operand 8 states and 222 transitions. [2024-06-27 22:17:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 329 transitions, 4377 flow [2024-06-27 22:17:43,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 329 transitions, 4273 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:17:43,523 INFO L231 Difference]: Finished difference. Result has 149 places, 270 transitions, 3468 flow [2024-06-27 22:17:43,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3468, PETRI_PLACES=149, PETRI_TRANSITIONS=270} [2024-06-27 22:17:43,524 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 96 predicate places. [2024-06-27 22:17:43,524 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 270 transitions, 3468 flow [2024-06-27 22:17:43,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:43,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:43,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:17:43,525 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:43,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1701809825, now seen corresponding path program 3 times [2024-06-27 22:17:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996466006] [2024-06-27 22:17:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:45,456 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 22:17:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996466006] [2024-06-27 22:17:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996466006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:45,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:45,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592102327] [2024-06-27 22:17:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:45,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:17:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:17:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:17:45,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:17:45,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 270 transitions, 3468 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:45,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:45,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:17:45,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:47,567 INFO L124 PetriNetUnfolderBase]: 7019/11706 cut-off events. [2024-06-27 22:17:47,568 INFO L125 PetriNetUnfolderBase]: For 111979/113633 co-relation queries the response was YES. [2024-06-27 22:17:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64315 conditions, 11706 events. 7019/11706 cut-off events. For 111979/113633 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 86283 event pairs, 1881 based on Foata normal form. 353/11293 useless extension candidates. Maximal degree in co-relation 64241. Up to 8190 conditions per place. [2024-06-27 22:17:47,692 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 218 selfloop transitions, 86 changer transitions 0/336 dead transitions. [2024-06-27 22:17:47,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 336 transitions, 4540 flow [2024-06-27 22:17:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:17:47,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5824468085106383 [2024-06-27 22:17:47,693 INFO L175 Difference]: Start difference. First operand has 149 places, 270 transitions, 3468 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:17:47,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 336 transitions, 4540 flow [2024-06-27 22:17:47,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 336 transitions, 4385 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 22:17:47,880 INFO L231 Difference]: Finished difference. Result has 153 places, 278 transitions, 3699 flow [2024-06-27 22:17:47,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3699, PETRI_PLACES=153, PETRI_TRANSITIONS=278} [2024-06-27 22:17:47,881 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 100 predicate places. [2024-06-27 22:17:47,881 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 278 transitions, 3699 flow [2024-06-27 22:17:47,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 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 22:17:47,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:47,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:47,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:17:47,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:47,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2012204919, now seen corresponding path program 1 times [2024-06-27 22:17:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246182705] [2024-06-27 22:17:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:49,514 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 22:17:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246182705] [2024-06-27 22:17:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246182705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:17:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686227384] [2024-06-27 22:17:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:49,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:17:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:17:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:17:49,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:49,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 278 transitions, 3699 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:17:49,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:49,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:49,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:52,719 INFO L124 PetriNetUnfolderBase]: 11045/17275 cut-off events. [2024-06-27 22:17:52,720 INFO L125 PetriNetUnfolderBase]: For 159618/159624 co-relation queries the response was YES. [2024-06-27 22:17:52,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96781 conditions, 17275 events. 11045/17275 cut-off events. For 159618/159624 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 119819 event pairs, 2668 based on Foata normal form. 17/16886 useless extension candidates. Maximal degree in co-relation 96704. Up to 13967 conditions per place. [2024-06-27 22:17:52,891 INFO L140 encePairwiseOnDemand]: 29/47 looper letters, 334 selfloop transitions, 116 changer transitions 0/458 dead transitions. [2024-06-27 22:17:52,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 458 transitions, 6903 flow [2024-06-27 22:17:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 264 transitions. [2024-06-27 22:17:52,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 22:17:52,892 INFO L175 Difference]: Start difference. First operand has 153 places, 278 transitions, 3699 flow. Second operand 11 states and 264 transitions. [2024-06-27 22:17:52,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 458 transitions, 6903 flow [2024-06-27 22:17:53,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 458 transitions, 6727 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:17:53,194 INFO L231 Difference]: Finished difference. Result has 165 places, 373 transitions, 5645 flow [2024-06-27 22:17:53,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5645, PETRI_PLACES=165, PETRI_TRANSITIONS=373} [2024-06-27 22:17:53,194 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 112 predicate places. [2024-06-27 22:17:53,194 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 373 transitions, 5645 flow [2024-06-27 22:17:53,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:17:53,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:53,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:17:53,195 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:53,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 436573239, now seen corresponding path program 2 times [2024-06-27 22:17:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996646456] [2024-06-27 22:17:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:55,236 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 22:17:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996646456] [2024-06-27 22:17:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996646456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:17:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053610983] [2024-06-27 22:17:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:55,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:17:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:17:55,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:17:55,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:17:55,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 373 transitions, 5645 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:17:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:17:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:59,364 INFO L124 PetriNetUnfolderBase]: 13477/21197 cut-off events. [2024-06-27 22:17:59,365 INFO L125 PetriNetUnfolderBase]: For 235081/235087 co-relation queries the response was YES. [2024-06-27 22:17:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122513 conditions, 21197 events. 13477/21197 cut-off events. For 235081/235087 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 151668 event pairs, 4976 based on Foata normal form. 109/20824 useless extension candidates. Maximal degree in co-relation 122429. Up to 14605 conditions per place. [2024-06-27 22:18:00,033 INFO L140 encePairwiseOnDemand]: 29/47 looper letters, 440 selfloop transitions, 110 changer transitions 0/558 dead transitions. [2024-06-27 22:18:00,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 558 transitions, 8808 flow [2024-06-27 22:18:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:18:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:18:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2024-06-27 22:18:00,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340425531914894 [2024-06-27 22:18:00,034 INFO L175 Difference]: Start difference. First operand has 165 places, 373 transitions, 5645 flow. Second operand 10 states and 251 transitions. [2024-06-27 22:18:00,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 558 transitions, 8808 flow [2024-06-27 22:18:00,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 558 transitions, 8487 flow, removed 153 selfloop flow, removed 2 redundant places. [2024-06-27 22:18:00,544 INFO L231 Difference]: Finished difference. Result has 177 places, 428 transitions, 6802 flow [2024-06-27 22:18:00,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5486, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6802, PETRI_PLACES=177, PETRI_TRANSITIONS=428} [2024-06-27 22:18:00,545 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 124 predicate places. [2024-06-27 22:18:00,545 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 428 transitions, 6802 flow [2024-06-27 22:18:00,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:00,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:00,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:18:00,546 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:00,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash -805970533, now seen corresponding path program 3 times [2024-06-27 22:18:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739348645] [2024-06-27 22:18:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:02,411 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 22:18:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739348645] [2024-06-27 22:18:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739348645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:02,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:18:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85838932] [2024-06-27 22:18:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:02,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:18:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:18:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:18:02,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:18:02,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 428 transitions, 6802 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:02,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:02,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:18:02,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:06,841 INFO L124 PetriNetUnfolderBase]: 13726/21605 cut-off events. [2024-06-27 22:18:06,841 INFO L125 PetriNetUnfolderBase]: For 267447/267447 co-relation queries the response was YES. [2024-06-27 22:18:06,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131661 conditions, 21605 events. 13726/21605 cut-off events. For 267447/267447 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 155533 event pairs, 5437 based on Foata normal form. 20/21134 useless extension candidates. Maximal degree in co-relation 131571. Up to 18883 conditions per place. [2024-06-27 22:18:07,513 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 439 selfloop transitions, 50 changer transitions 0/497 dead transitions. [2024-06-27 22:18:07,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 497 transitions, 8292 flow [2024-06-27 22:18:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:18:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:18:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-06-27 22:18:07,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2024-06-27 22:18:07,527 INFO L175 Difference]: Start difference. First operand has 177 places, 428 transitions, 6802 flow. Second operand 10 states and 229 transitions. [2024-06-27 22:18:07,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 497 transitions, 8292 flow [2024-06-27 22:18:08,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 497 transitions, 8207 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-27 22:18:08,204 INFO L231 Difference]: Finished difference. Result has 184 places, 430 transitions, 6877 flow [2024-06-27 22:18:08,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6719, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6877, PETRI_PLACES=184, PETRI_TRANSITIONS=430} [2024-06-27 22:18:08,204 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 131 predicate places. [2024-06-27 22:18:08,205 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 430 transitions, 6877 flow [2024-06-27 22:18:08,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:08,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:08,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:18:08,205 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:08,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1964005241, now seen corresponding path program 4 times [2024-06-27 22:18:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219351255] [2024-06-27 22:18:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:10,090 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 22:18:10,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219351255] [2024-06-27 22:18:10,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219351255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:18:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226773740] [2024-06-27 22:18:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:10,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:18:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:18:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:18:10,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:18:10,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 430 transitions, 6877 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:10,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:10,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:18:10,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:14,583 INFO L124 PetriNetUnfolderBase]: 13975/22002 cut-off events. [2024-06-27 22:18:14,584 INFO L125 PetriNetUnfolderBase]: For 278248/278248 co-relation queries the response was YES. [2024-06-27 22:18:14,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134022 conditions, 22002 events. 13975/22002 cut-off events. For 278248/278248 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 158748 event pairs, 5507 based on Foata normal form. 20/21524 useless extension candidates. Maximal degree in co-relation 133930. Up to 19281 conditions per place. [2024-06-27 22:18:14,814 INFO L140 encePairwiseOnDemand]: 30/47 looper letters, 447 selfloop transitions, 44 changer transitions 0/499 dead transitions. [2024-06-27 22:18:14,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 499 transitions, 8370 flow [2024-06-27 22:18:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:18:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:18:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 22:18:14,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-06-27 22:18:14,815 INFO L175 Difference]: Start difference. First operand has 184 places, 430 transitions, 6877 flow. Second operand 9 states and 213 transitions. [2024-06-27 22:18:14,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 499 transitions, 8370 flow [2024-06-27 22:18:15,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 499 transitions, 8250 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 22:18:15,401 INFO L231 Difference]: Finished difference. Result has 185 places, 433 transitions, 6936 flow [2024-06-27 22:18:15,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6761, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6936, PETRI_PLACES=185, PETRI_TRANSITIONS=433} [2024-06-27 22:18:15,402 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 132 predicate places. [2024-06-27 22:18:15,402 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 433 transitions, 6936 flow [2024-06-27 22:18:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:15,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:15,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:15,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:18:15,402 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:15,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1973172933, now seen corresponding path program 1 times [2024-06-27 22:18:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766821809] [2024-06-27 22:18:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:16,955 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 22:18:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766821809] [2024-06-27 22:18:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766821809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:16,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:18:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803872267] [2024-06-27 22:18:16,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:16,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:18:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:18:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:18:17,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:18:17,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 433 transitions, 6936 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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 22:18:17,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:17,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:18:17,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:21,232 INFO L124 PetriNetUnfolderBase]: 14071/22058 cut-off events. [2024-06-27 22:18:21,232 INFO L125 PetriNetUnfolderBase]: For 288966/288972 co-relation queries the response was YES. [2024-06-27 22:18:21,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135605 conditions, 22058 events. 14071/22058 cut-off events. For 288966/288972 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 158222 event pairs, 5497 based on Foata normal form. 10/21583 useless extension candidates. Maximal degree in co-relation 135512. Up to 19687 conditions per place. [2024-06-27 22:18:21,763 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 439 selfloop transitions, 81 changer transitions 0/528 dead transitions. [2024-06-27 22:18:21,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 528 transitions, 8855 flow [2024-06-27 22:18:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:18:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:18:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-06-27 22:18:21,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988179669030733 [2024-06-27 22:18:21,765 INFO L175 Difference]: Start difference. First operand has 185 places, 433 transitions, 6936 flow. Second operand 9 states and 211 transitions. [2024-06-27 22:18:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 528 transitions, 8855 flow [2024-06-27 22:18:22,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 528 transitions, 8740 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 22:18:22,521 INFO L231 Difference]: Finished difference. Result has 192 places, 478 transitions, 7741 flow [2024-06-27 22:18:22,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6821, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7741, PETRI_PLACES=192, PETRI_TRANSITIONS=478} [2024-06-27 22:18:22,522 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 139 predicate places. [2024-06-27 22:18:22,522 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 478 transitions, 7741 flow [2024-06-27 22:18:22,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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 22:18:22,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:22,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:18:22,523 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:22,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash -541195813, now seen corresponding path program 5 times [2024-06-27 22:18:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939838763] [2024-06-27 22:18:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:24,119 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 22:18:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939838763] [2024-06-27 22:18:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939838763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:18:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37651198] [2024-06-27 22:18:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:18:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:18:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:18:24,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:18:24,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 478 transitions, 7741 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:24,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:24,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:18:24,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:28,815 INFO L124 PetriNetUnfolderBase]: 14377/22572 cut-off events. [2024-06-27 22:18:28,815 INFO L125 PetriNetUnfolderBase]: For 322306/322306 co-relation queries the response was YES. [2024-06-27 22:18:28,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142828 conditions, 22572 events. 14377/22572 cut-off events. For 322306/322306 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 162927 event pairs, 5463 based on Foata normal form. 21/22084 useless extension candidates. Maximal degree in co-relation 142730. Up to 19663 conditions per place. [2024-06-27 22:18:29,088 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 466 selfloop transitions, 94 changer transitions 0/568 dead transitions. [2024-06-27 22:18:29,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 568 transitions, 9664 flow [2024-06-27 22:18:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:18:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:18:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:18:29,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 22:18:29,090 INFO L175 Difference]: Start difference. First operand has 192 places, 478 transitions, 7741 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:18:29,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 568 transitions, 9664 flow [2024-06-27 22:18:29,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 568 transitions, 9539 flow, removed 55 selfloop flow, removed 2 redundant places. [2024-06-27 22:18:29,784 INFO L231 Difference]: Finished difference. Result has 200 places, 502 transitions, 8295 flow [2024-06-27 22:18:29,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7620, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8295, PETRI_PLACES=200, PETRI_TRANSITIONS=502} [2024-06-27 22:18:29,785 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 147 predicate places. [2024-06-27 22:18:29,785 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 502 transitions, 8295 flow [2024-06-27 22:18:29,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:29,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:29,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:29,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:18:29,786 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:29,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1973498681, now seen corresponding path program 6 times [2024-06-27 22:18:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215153772] [2024-06-27 22:18:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:31,701 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 22:18:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215153772] [2024-06-27 22:18:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215153772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:18:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125099433] [2024-06-27 22:18:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:18:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:18:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:18:31,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:18:31,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 502 transitions, 8295 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 22:18:31,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:31,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:18:31,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand