./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb4cb34f 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/thin002_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_power.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-eb4cb34-m [2024-06-21 19:50:01,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-21 19:50:01,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-21 19:50:01,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-21 19:50:01,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-21 19:50:02,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-21 19:50:02,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-21 19:50:02,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-21 19:50:02,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-21 19:50:02,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-21 19:50:02,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-21 19:50:02,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-21 19:50:02,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-21 19:50:02,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-21 19:50:02,039 INFO L153 SettingsManager]: * Use SBE=true [2024-06-21 19:50:02,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-21 19:50:02,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-21 19:50:02,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-21 19:50:02,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-21 19:50:02,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-21 19:50:02,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-21 19:50:02,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-21 19:50:02,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-21 19:50:02,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-21 19:50:02,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-21 19:50:02,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-21 19:50:02,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-21 19:50:02,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-21 19:50:02,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-21 19:50:02,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-21 19:50:02,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-21 19:50:02,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-21 19:50:02,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 19:50:02,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-21 19:50:02,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-21 19:50:02,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-21 19:50:02,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-21 19:50:02,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-21 19:50:02,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-21 19:50:02,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-21 19:50:02,051 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-21 19:50:02,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-21 19:50:02,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-21 19:50:02,052 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-21 19:50:02,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-21 19:50:02,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-21 19:50:02,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-21 19:50:02,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-21 19:50:02,304 INFO L274 PluginConnector]: CDTParser initialized [2024-06-21 19:50:02,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-21 19:50:03,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-21 19:50:03,641 INFO L384 CDTParser]: Found 1 translation units. [2024-06-21 19:50:03,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-21 19:50:03,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b25e7b30/40c20389c5a8449694a7f274d3e26b43/FLAG2dcd77fd0 [2024-06-21 19:50:03,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b25e7b30/40c20389c5a8449694a7f274d3e26b43 [2024-06-21 19:50:03,693 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-21 19:50:03,694 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-21 19:50:03,695 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/thin002_power.oepc.yml/witness.yml [2024-06-21 19:50:03,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-21 19:50:03,805 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-21 19:50:03,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-21 19:50:03,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-21 19:50:03,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-21 19:50:03,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 07:50:03" (1/2) ... [2024-06-21 19:50:03,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d82a5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 07:50:03, skipping insertion in model container [2024-06-21 19:50:03,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 07:50:03" (1/2) ... [2024-06-21 19:50:03,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5eac4cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 07:50:03, skipping insertion in model container [2024-06-21 19:50:03,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 07:50:03" (2/2) ... [2024-06-21 19:50:03,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d82a5d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:03, skipping insertion in model container [2024-06-21 19:50:03,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 07:50:03" (2/2) ... [2024-06-21 19:50:03,817 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-21 19:50:03,842 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-21 19:50:03,843 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-21 19:50:03,844 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-21 19:50:03,844 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-21 19:50:03,844 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-21 19:50:03,845 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-21 19:50:03,846 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-21 19:50:03,884 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-21 19:50:04,147 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 19:50:04,162 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-21 19:50:04,479 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-21 19:50:04,515 INFO L206 MainTranslator]: Completed translation [2024-06-21 19:50:04,516 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04 WrapperNode [2024-06-21 19:50:04,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-21 19:50:04,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-21 19:50:04,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-21 19:50:04,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-21 19:50:04,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,669 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2024-06-21 19:50:04,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-21 19:50:04,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-21 19:50:04,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-21 19:50:04,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-21 19:50:04,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,740 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [2, 23]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-21 19:50:04,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-21 19:50:04,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-21 19:50:04,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-21 19:50:04,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-21 19:50:04,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (1/1) ... [2024-06-21 19:50:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-21 19:50:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-21 19:50:04,825 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-21 19:50:04,829 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-21 19:50:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-21 19:50:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-21 19:50:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-21 19:50:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-21 19:50:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-21 19:50:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-21 19:50:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-21 19:50:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-21 19:50:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-21 19:50:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-21 19:50:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-21 19:50:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-21 19:50:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-21 19:50:04,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-21 19:50:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-21 19:50:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-21 19:50:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-21 19:50:04,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-21 19:50:04,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-21 19:50:04,871 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-21 19:50:05,018 INFO L244 CfgBuilder]: Building ICFG [2024-06-21 19:50:05,020 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-21 19:50:05,654 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-21 19:50:05,655 INFO L293 CfgBuilder]: Performing block encoding [2024-06-21 19:50:06,018 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-21 19:50:06,018 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-21 19:50:06,019 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 07:50:06 BoogieIcfgContainer [2024-06-21 19:50:06,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-21 19:50:06,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-21 19:50:06,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-21 19:50:06,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-21 19:50:06,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 07:50:03" (1/4) ... [2024-06-21 19:50:06,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca91bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 07:50:06, skipping insertion in model container [2024-06-21 19:50:06,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 21.06 07:50:03" (2/4) ... [2024-06-21 19:50:06,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca91bf2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 07:50:06, skipping insertion in model container [2024-06-21 19:50:06,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 21.06 07:50:04" (3/4) ... [2024-06-21 19:50:06,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca91bf2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 21.06 07:50:06, skipping insertion in model container [2024-06-21 19:50:06,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 07:50:06" (4/4) ... [2024-06-21 19:50:06,024 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2024-06-21 19:50:06,039 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-21 19:50:06,039 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-21 19:50:06,039 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-21 19:50:06,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-21 19:50:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 124 flow [2024-06-21 19:50:06,195 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-06-21 19:50:06,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 19:50:06,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-21 19:50:06,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 54 transitions, 124 flow [2024-06-21 19:50:06,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 100 flow [2024-06-21 19:50:06,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-21 19:50:06,235 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;@62cf6608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-21 19:50:06,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-21 19:50:06,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-21 19:50:06,241 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-21 19:50:06,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-21 19:50:06,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:06,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-21 19:50:06,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:06,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 656171716, now seen corresponding path program 1 times [2024-06-21 19:50:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443884011] [2024-06-21 19:50:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:09,649 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-21 19:50:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443884011] [2024-06-21 19:50:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443884011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:09,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-21 19:50:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46543812] [2024-06-21 19:50:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:09,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-21 19:50:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-21 19:50:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-21 19:50:09,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2024-06-21 19:50:09,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-21 19:50:09,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:09,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2024-06-21 19:50:09,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:11,312 INFO L124 PetriNetUnfolderBase]: 4406/6336 cut-off events. [2024-06-21 19:50:11,313 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-06-21 19:50:11,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12682 conditions, 6336 events. 4406/6336 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34587 event pairs, 3188 based on Foata normal form. 1/6203 useless extension candidates. Maximal degree in co-relation 12669. Up to 6114 conditions per place. [2024-06-21 19:50:11,345 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 45 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-21 19:50:11,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 243 flow [2024-06-21 19:50:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-21 19:50:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-21 19:50:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-21 19:50:11,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-06-21 19:50:11,355 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 99 transitions. [2024-06-21 19:50:11,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 243 flow [2024-06-21 19:50:11,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-21 19:50:11,360 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 135 flow [2024-06-21 19:50:11,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-21 19:50:11,363 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-21 19:50:11,363 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 135 flow [2024-06-21 19:50:11,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-21 19:50:11,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:11,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:11,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-21 19:50:11,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:11,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash -778355763, now seen corresponding path program 1 times [2024-06-21 19:50:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988331658] [2024-06-21 19:50:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:15,286 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-21 19:50:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988331658] [2024-06-21 19:50:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988331658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:15,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:15,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-21 19:50:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729336242] [2024-06-21 19:50:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:15,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-21 19:50:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:15,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-21 19:50:15,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-21 19:50:15,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2024-06-21 19:50:15,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-21 19:50:15,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:15,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2024-06-21 19:50:15,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:17,147 INFO L124 PetriNetUnfolderBase]: 4396/6307 cut-off events. [2024-06-21 19:50:17,147 INFO L125 PetriNetUnfolderBase]: For 1199/1209 co-relation queries the response was YES. [2024-06-21 19:50:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14561 conditions, 6307 events. 4396/6307 cut-off events. For 1199/1209 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33965 event pairs, 2767 based on Foata normal form. 10/6313 useless extension candidates. Maximal degree in co-relation 14549. Up to 6073 conditions per place. [2024-06-21 19:50:17,178 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 58 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2024-06-21 19:50:17,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 347 flow [2024-06-21 19:50:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-21 19:50:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-21 19:50:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-21 19:50:17,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2024-06-21 19:50:17,181 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 135 flow. Second operand 4 states and 131 transitions. [2024-06-21 19:50:17,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 347 flow [2024-06-21 19:50:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-21 19:50:17,183 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 183 flow [2024-06-21 19:50:17,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-21 19:50:17,184 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2024-06-21 19:50:17,184 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 183 flow [2024-06-21 19:50:17,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-21 19:50:17,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:17,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:17,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-21 19:50:17,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:17,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1640776411, now seen corresponding path program 1 times [2024-06-21 19:50:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265704112] [2024-06-21 19:50:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:21,144 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-21 19:50:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265704112] [2024-06-21 19:50:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265704112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-21 19:50:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217519421] [2024-06-21 19:50:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-21 19:50:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-21 19:50:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-21 19:50:21,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-06-21 19:50:21,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-21 19:50:21,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:21,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-06-21 19:50:21,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:23,596 INFO L124 PetriNetUnfolderBase]: 5573/7932 cut-off events. [2024-06-21 19:50:23,596 INFO L125 PetriNetUnfolderBase]: For 4121/4139 co-relation queries the response was YES. [2024-06-21 19:50:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20459 conditions, 7932 events. 5573/7932 cut-off events. For 4121/4139 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 42899 event pairs, 2919 based on Foata normal form. 16/7945 useless extension candidates. Maximal degree in co-relation 20445. Up to 7638 conditions per place. [2024-06-21 19:50:23,638 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 80 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-21 19:50:23,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 523 flow [2024-06-21 19:50:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 19:50:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 19:50:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-06-21 19:50:23,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-21 19:50:23,644 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 183 flow. Second operand 5 states and 159 transitions. [2024-06-21 19:50:23,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 523 flow [2024-06-21 19:50:23,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 492 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-21 19:50:23,650 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 279 flow [2024-06-21 19:50:23,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-06-21 19:50:23,651 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2024-06-21 19:50:23,652 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 279 flow [2024-06-21 19:50:23,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-21 19:50:23,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:23,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:23,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-21 19:50:23,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:23,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1181600252, now seen corresponding path program 1 times [2024-06-21 19:50:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183697169] [2024-06-21 19:50:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:28,138 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-21 19:50:28,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183697169] [2024-06-21 19:50:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183697169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:28,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 19:50:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414887715] [2024-06-21 19:50:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:28,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 19:50:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:28,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 19:50:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-21 19:50:28,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-06-21 19:50:28,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-21 19:50:28,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:28,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-06-21 19:50:28,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:30,596 INFO L124 PetriNetUnfolderBase]: 5557/7912 cut-off events. [2024-06-21 19:50:30,597 INFO L125 PetriNetUnfolderBase]: For 7471/7516 co-relation queries the response was YES. [2024-06-21 19:50:30,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22651 conditions, 7912 events. 5557/7912 cut-off events. For 7471/7516 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 42865 event pairs, 2329 based on Foata normal form. 32/7941 useless extension candidates. Maximal degree in co-relation 22634. Up to 7560 conditions per place. [2024-06-21 19:50:30,638 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 89 selfloop transitions, 16 changer transitions 0/115 dead transitions. [2024-06-21 19:50:30,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 621 flow [2024-06-21 19:50:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 19:50:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 19:50:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-21 19:50:30,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-06-21 19:50:30,641 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 279 flow. Second operand 6 states and 185 transitions. [2024-06-21 19:50:30,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 621 flow [2024-06-21 19:50:30,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 613 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-21 19:50:30,645 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 331 flow [2024-06-21 19:50:30,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-21 19:50:30,645 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-06-21 19:50:30,646 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 331 flow [2024-06-21 19:50:30,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-21 19:50:30,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:30,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:30,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-21 19:50:30,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:30,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1542593831, now seen corresponding path program 1 times [2024-06-21 19:50:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251496347] [2024-06-21 19:50:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:34,693 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-21 19:50:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251496347] [2024-06-21 19:50:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251496347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:34,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 19:50:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709502504] [2024-06-21 19:50:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:34,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 19:50:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 19:50:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 19:50:34,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:50:34,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-21 19:50:34,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:34,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:50:34,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:37,499 INFO L124 PetriNetUnfolderBase]: 6967/9830 cut-off events. [2024-06-21 19:50:37,499 INFO L125 PetriNetUnfolderBase]: For 14336/14388 co-relation queries the response was YES. [2024-06-21 19:50:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29876 conditions, 9830 events. 6967/9830 cut-off events. For 14336/14388 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 53062 event pairs, 3303 based on Foata normal form. 19/9838 useless extension candidates. Maximal degree in co-relation 29855. Up to 9435 conditions per place. [2024-06-21 19:50:37,550 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 83 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2024-06-21 19:50:37,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 719 flow [2024-06-21 19:50:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-21 19:50:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-21 19:50:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-06-21 19:50:37,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2024-06-21 19:50:37,559 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 331 flow. Second operand 5 states and 133 transitions. [2024-06-21 19:50:37,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 719 flow [2024-06-21 19:50:37,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 661 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-21 19:50:37,566 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 454 flow [2024-06-21 19:50:37,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-21 19:50:37,569 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-06-21 19:50:37,569 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 454 flow [2024-06-21 19:50:37,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-21 19:50:37,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:37,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:37,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-21 19:50:37,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:37,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1956570536, now seen corresponding path program 1 times [2024-06-21 19:50:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483775765] [2024-06-21 19:50:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:43,809 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-21 19:50:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483775765] [2024-06-21 19:50:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483775765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:43,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:43,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 19:50:43,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327090684] [2024-06-21 19:50:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:43,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 19:50:43,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:43,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 19:50:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-21 19:50:43,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:50:43,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:50:43,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:43,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:50:43,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:46,973 INFO L124 PetriNetUnfolderBase]: 6926/9836 cut-off events. [2024-06-21 19:50:46,973 INFO L125 PetriNetUnfolderBase]: For 21318/21555 co-relation queries the response was YES. [2024-06-21 19:50:46,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33410 conditions, 9836 events. 6926/9836 cut-off events. For 21318/21555 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54461 event pairs, 2829 based on Foata normal form. 90/9884 useless extension candidates. Maximal degree in co-relation 33384. Up to 9235 conditions per place. [2024-06-21 19:50:47,033 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 133 selfloop transitions, 43 changer transitions 0/187 dead transitions. [2024-06-21 19:50:47,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 187 transitions, 1238 flow [2024-06-21 19:50:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 19:50:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 19:50:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 294 transitions. [2024-06-21 19:50:47,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-06-21 19:50:47,035 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 454 flow. Second operand 11 states and 294 transitions. [2024-06-21 19:50:47,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 187 transitions, 1238 flow [2024-06-21 19:50:47,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 1230 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-21 19:50:47,047 INFO L231 Difference]: Finished difference. Result has 85 places, 106 transitions, 736 flow [2024-06-21 19:50:47,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=736, PETRI_PLACES=85, PETRI_TRANSITIONS=106} [2024-06-21 19:50:47,048 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2024-06-21 19:50:47,048 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 106 transitions, 736 flow [2024-06-21 19:50:47,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:50:47,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:47,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:47,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-21 19:50:47,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:47,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2079026332, now seen corresponding path program 2 times [2024-06-21 19:50:47,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951771604] [2024-06-21 19:50:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:50:54,391 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-21 19:50:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:50:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951771604] [2024-06-21 19:50:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951771604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:50:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:50:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 19:50:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8971317] [2024-06-21 19:50:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:50:54,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 19:50:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:50:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 19:50:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 19:50:54,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:50:54,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 106 transitions, 736 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:50:54,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:50:54,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:50:54,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:50:57,295 INFO L124 PetriNetUnfolderBase]: 7051/10058 cut-off events. [2024-06-21 19:50:57,295 INFO L125 PetriNetUnfolderBase]: For 36031/36435 co-relation queries the response was YES. [2024-06-21 19:50:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39257 conditions, 10058 events. 7051/10058 cut-off events. For 36031/36435 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 56072 event pairs, 2877 based on Foata normal form. 70/10064 useless extension candidates. Maximal degree in co-relation 39225. Up to 9459 conditions per place. [2024-06-21 19:50:57,352 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 100 selfloop transitions, 54 changer transitions 0/165 dead transitions. [2024-06-21 19:50:57,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 165 transitions, 1372 flow [2024-06-21 19:50:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 19:50:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 19:50:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-21 19:50:57,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-21 19:50:57,355 INFO L175 Difference]: Start difference. First operand has 85 places, 106 transitions, 736 flow. Second operand 6 states and 168 transitions. [2024-06-21 19:50:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 165 transitions, 1372 flow [2024-06-21 19:50:57,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 1296 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-21 19:50:57,385 INFO L231 Difference]: Finished difference. Result has 87 places, 130 transitions, 1076 flow [2024-06-21 19:50:57,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1076, PETRI_PLACES=87, PETRI_TRANSITIONS=130} [2024-06-21 19:50:57,386 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-06-21 19:50:57,386 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 130 transitions, 1076 flow [2024-06-21 19:50:57,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:50:57,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:50:57,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:50:57,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-21 19:50:57,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:50:57,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:50:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1907641376, now seen corresponding path program 3 times [2024-06-21 19:50:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:50:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391932450] [2024-06-21 19:50:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:50:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:50:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:01,716 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-21 19:51:01,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391932450] [2024-06-21 19:51:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391932450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:01,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 19:51:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255140538] [2024-06-21 19:51:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:01,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 19:51:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 19:51:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 19:51:01,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:51:01,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 130 transitions, 1076 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:51:01,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:01,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:51:01,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:04,893 INFO L124 PetriNetUnfolderBase]: 7039/10072 cut-off events. [2024-06-21 19:51:04,894 INFO L125 PetriNetUnfolderBase]: For 48223/48675 co-relation queries the response was YES. [2024-06-21 19:51:04,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41762 conditions, 10072 events. 7039/10072 cut-off events. For 48223/48675 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 56363 event pairs, 2835 based on Foata normal form. 112/10095 useless extension candidates. Maximal degree in co-relation 41727. Up to 9252 conditions per place. [2024-06-21 19:51:04,950 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 87 selfloop transitions, 77 changer transitions 0/175 dead transitions. [2024-06-21 19:51:04,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 1617 flow [2024-06-21 19:51:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 19:51:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 19:51:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-21 19:51:04,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-21 19:51:04,953 INFO L175 Difference]: Start difference. First operand has 87 places, 130 transitions, 1076 flow. Second operand 7 states and 176 transitions. [2024-06-21 19:51:04,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 175 transitions, 1617 flow [2024-06-21 19:51:04,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 175 transitions, 1518 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-21 19:51:04,993 INFO L231 Difference]: Finished difference. Result has 93 places, 146 transitions, 1347 flow [2024-06-21 19:51:04,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1347, PETRI_PLACES=93, PETRI_TRANSITIONS=146} [2024-06-21 19:51:04,993 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 36 predicate places. [2024-06-21 19:51:04,993 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 146 transitions, 1347 flow [2024-06-21 19:51:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-21 19:51:04,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:04,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-21 19:51:04,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:04,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2129834694, now seen corresponding path program 1 times [2024-06-21 19:51:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709059605] [2024-06-21 19:51:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:09,482 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-21 19:51:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709059605] [2024-06-21 19:51:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709059605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-21 19:51:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206654333] [2024-06-21 19:51:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:09,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-21 19:51:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-21 19:51:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-21 19:51:09,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:51:09,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 146 transitions, 1347 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-21 19:51:09,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:09,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:51:09,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:12,679 INFO L124 PetriNetUnfolderBase]: 7546/10683 cut-off events. [2024-06-21 19:51:12,679 INFO L125 PetriNetUnfolderBase]: For 65335/65703 co-relation queries the response was YES. [2024-06-21 19:51:12,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47154 conditions, 10683 events. 7546/10683 cut-off events. For 65335/65703 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 58227 event pairs, 3003 based on Foata normal form. 89/10749 useless extension candidates. Maximal degree in co-relation 47116. Up to 10078 conditions per place. [2024-06-21 19:51:12,737 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 150 selfloop transitions, 28 changer transitions 0/186 dead transitions. [2024-06-21 19:51:12,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 186 transitions, 1854 flow [2024-06-21 19:51:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-21 19:51:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-21 19:51:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-21 19:51:12,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-21 19:51:12,739 INFO L175 Difference]: Start difference. First operand has 93 places, 146 transitions, 1347 flow. Second operand 7 states and 171 transitions. [2024-06-21 19:51:12,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 186 transitions, 1854 flow [2024-06-21 19:51:12,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 186 transitions, 1823 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-21 19:51:12,788 INFO L231 Difference]: Finished difference. Result has 98 places, 150 transitions, 1425 flow [2024-06-21 19:51:12,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1425, PETRI_PLACES=98, PETRI_TRANSITIONS=150} [2024-06-21 19:51:12,789 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2024-06-21 19:51:12,790 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 150 transitions, 1425 flow [2024-06-21 19:51:12,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-21 19:51:12,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:12,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:12,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-21 19:51:12,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:12,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash -527717108, now seen corresponding path program 1 times [2024-06-21 19:51:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968242387] [2024-06-21 19:51:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:19,736 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-21 19:51:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968242387] [2024-06-21 19:51:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968242387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:51:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715069404] [2024-06-21 19:51:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:19,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:51:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:51:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:51:19,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:51:19,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 150 transitions, 1425 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:19,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:19,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:51:19,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:23,423 INFO L124 PetriNetUnfolderBase]: 7694/10971 cut-off events. [2024-06-21 19:51:23,424 INFO L125 PetriNetUnfolderBase]: For 79482/79654 co-relation queries the response was YES. [2024-06-21 19:51:23,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50744 conditions, 10971 events. 7694/10971 cut-off events. For 79482/79654 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 61026 event pairs, 3653 based on Foata normal form. 68/10970 useless extension candidates. Maximal degree in co-relation 50704. Up to 10122 conditions per place. [2024-06-21 19:51:23,599 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 226 selfloop transitions, 61 changer transitions 0/295 dead transitions. [2024-06-21 19:51:23,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 295 transitions, 2793 flow [2024-06-21 19:51:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 19:51:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 19:51:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 311 transitions. [2024-06-21 19:51:23,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799382716049383 [2024-06-21 19:51:23,602 INFO L175 Difference]: Start difference. First operand has 98 places, 150 transitions, 1425 flow. Second operand 12 states and 311 transitions. [2024-06-21 19:51:23,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 295 transitions, 2793 flow [2024-06-21 19:51:23,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 295 transitions, 2697 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-21 19:51:23,681 INFO L231 Difference]: Finished difference. Result has 113 places, 200 transitions, 2009 flow [2024-06-21 19:51:23,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2009, PETRI_PLACES=113, PETRI_TRANSITIONS=200} [2024-06-21 19:51:23,682 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2024-06-21 19:51:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 200 transitions, 2009 flow [2024-06-21 19:51:23,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:23,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:23,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-21 19:51:23,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:23,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1487974412, now seen corresponding path program 2 times [2024-06-21 19:51:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463655131] [2024-06-21 19:51:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:28,998 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-21 19:51:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463655131] [2024-06-21 19:51:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463655131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:28,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:28,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:51:28,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344874334] [2024-06-21 19:51:28,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:28,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:51:28,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:51:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:51:29,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:51:29,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 200 transitions, 2009 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:29,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:29,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:51:29,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:33,227 INFO L124 PetriNetUnfolderBase]: 7796/11078 cut-off events. [2024-06-21 19:51:33,227 INFO L125 PetriNetUnfolderBase]: For 93482/94063 co-relation queries the response was YES. [2024-06-21 19:51:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55068 conditions, 11078 events. 7796/11078 cut-off events. For 93482/94063 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 60751 event pairs, 3035 based on Foata normal form. 175/11229 useless extension candidates. Maximal degree in co-relation 55020. Up to 10129 conditions per place. [2024-06-21 19:51:33,305 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 207 selfloop transitions, 88 changer transitions 0/303 dead transitions. [2024-06-21 19:51:33,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 303 transitions, 3208 flow [2024-06-21 19:51:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 19:51:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 19:51:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2024-06-21 19:51:33,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2024-06-21 19:51:33,307 INFO L175 Difference]: Start difference. First operand has 113 places, 200 transitions, 2009 flow. Second operand 11 states and 272 transitions. [2024-06-21 19:51:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 303 transitions, 3208 flow [2024-06-21 19:51:33,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 303 transitions, 3162 flow, removed 22 selfloop flow, removed 1 redundant places. [2024-06-21 19:51:33,402 INFO L231 Difference]: Finished difference. Result has 126 places, 235 transitions, 2568 flow [2024-06-21 19:51:33,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2568, PETRI_PLACES=126, PETRI_TRANSITIONS=235} [2024-06-21 19:51:33,403 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2024-06-21 19:51:33,403 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 235 transitions, 2568 flow [2024-06-21 19:51:33,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:33,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:33,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:33,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-21 19:51:33,404 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:33,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash 992661772, now seen corresponding path program 3 times [2024-06-21 19:51:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:33,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098081848] [2024-06-21 19:51:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:38,403 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-21 19:51:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098081848] [2024-06-21 19:51:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098081848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:51:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785839669] [2024-06-21 19:51:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:51:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:51:38,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:51:38,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:51:38,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 235 transitions, 2568 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:38,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:38,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:51:38,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:42,076 INFO L124 PetriNetUnfolderBase]: 7762/11030 cut-off events. [2024-06-21 19:51:42,076 INFO L125 PetriNetUnfolderBase]: For 120254/120696 co-relation queries the response was YES. [2024-06-21 19:51:42,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59585 conditions, 11030 events. 7762/11030 cut-off events. For 120254/120696 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 60484 event pairs, 3055 based on Foata normal form. 140/11142 useless extension candidates. Maximal degree in co-relation 59531. Up to 10099 conditions per place. [2024-06-21 19:51:42,160 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 188 selfloop transitions, 82 changer transitions 0/278 dead transitions. [2024-06-21 19:51:42,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 278 transitions, 3273 flow [2024-06-21 19:51:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 19:51:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 19:51:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-21 19:51:42,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2024-06-21 19:51:42,162 INFO L175 Difference]: Start difference. First operand has 126 places, 235 transitions, 2568 flow. Second operand 8 states and 199 transitions. [2024-06-21 19:51:42,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 278 transitions, 3273 flow [2024-06-21 19:51:42,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 278 transitions, 3151 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-21 19:51:42,272 INFO L231 Difference]: Finished difference. Result has 130 places, 235 transitions, 2628 flow [2024-06-21 19:51:42,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2628, PETRI_PLACES=130, PETRI_TRANSITIONS=235} [2024-06-21 19:51:42,273 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 73 predicate places. [2024-06-21 19:51:42,273 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 235 transitions, 2628 flow [2024-06-21 19:51:42,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:51:42,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:42,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:42,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-21 19:51:42,274 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:42,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 817779231, now seen corresponding path program 1 times [2024-06-21 19:51:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513195095] [2024-06-21 19:51:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:48,569 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-21 19:51:48,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:48,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513195095] [2024-06-21 19:51:48,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513195095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:48,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:48,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:51:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894004831] [2024-06-21 19:51:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:48,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:51:48,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:51:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:51:48,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:51:48,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 235 transitions, 2628 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:51:48,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:48,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:51:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:51:52,499 INFO L124 PetriNetUnfolderBase]: 8112/11535 cut-off events. [2024-06-21 19:51:52,500 INFO L125 PetriNetUnfolderBase]: For 162226/162696 co-relation queries the response was YES. [2024-06-21 19:51:52,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66144 conditions, 11535 events. 8112/11535 cut-off events. For 162226/162696 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 65433 event pairs, 2800 based on Foata normal form. 117/11217 useless extension candidates. Maximal degree in co-relation 66088. Up to 9699 conditions per place. [2024-06-21 19:51:52,608 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 200 selfloop transitions, 106 changer transitions 0/339 dead transitions. [2024-06-21 19:51:52,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 339 transitions, 3734 flow [2024-06-21 19:51:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 19:51:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 19:51:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 324 transitions. [2024-06-21 19:51:52,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-21 19:51:52,611 INFO L175 Difference]: Start difference. First operand has 130 places, 235 transitions, 2628 flow. Second operand 12 states and 324 transitions. [2024-06-21 19:51:52,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 339 transitions, 3734 flow [2024-06-21 19:51:52,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 339 transitions, 3566 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-21 19:51:52,839 INFO L231 Difference]: Finished difference. Result has 136 places, 240 transitions, 2783 flow [2024-06-21 19:51:52,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2783, PETRI_PLACES=136, PETRI_TRANSITIONS=240} [2024-06-21 19:51:52,841 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 79 predicate places. [2024-06-21 19:51:52,841 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 240 transitions, 2783 flow [2024-06-21 19:51:52,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:51:52,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:51:52,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:51:52,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-21 19:51:52,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:51:52,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:51:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1900500603, now seen corresponding path program 2 times [2024-06-21 19:51:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:51:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40643345] [2024-06-21 19:51:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:51:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:51:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:51:59,485 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-21 19:51:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:51:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40643345] [2024-06-21 19:51:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40643345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:51:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:51:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:51:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480959776] [2024-06-21 19:51:59,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:51:59,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:51:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:51:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:51:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:51:59,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:51:59,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 240 transitions, 2783 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:51:59,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:51:59,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:51:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:03,690 INFO L124 PetriNetUnfolderBase]: 8453/12052 cut-off events. [2024-06-21 19:52:03,691 INFO L125 PetriNetUnfolderBase]: For 187742/188243 co-relation queries the response was YES. [2024-06-21 19:52:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72080 conditions, 12052 events. 8453/12052 cut-off events. For 187742/188243 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 68707 event pairs, 3481 based on Foata normal form. 98/11740 useless extension candidates. Maximal degree in co-relation 72022. Up to 10820 conditions per place. [2024-06-21 19:52:03,815 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 223 selfloop transitions, 96 changer transitions 0/352 dead transitions. [2024-06-21 19:52:03,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 352 transitions, 4135 flow [2024-06-21 19:52:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 19:52:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 19:52:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 296 transitions. [2024-06-21 19:52:03,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2024-06-21 19:52:03,825 INFO L175 Difference]: Start difference. First operand has 136 places, 240 transitions, 2783 flow. Second operand 11 states and 296 transitions. [2024-06-21 19:52:03,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 352 transitions, 4135 flow [2024-06-21 19:52:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 352 transitions, 3958 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-21 19:52:04,131 INFO L231 Difference]: Finished difference. Result has 141 places, 274 transitions, 3345 flow [2024-06-21 19:52:04,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3345, PETRI_PLACES=141, PETRI_TRANSITIONS=274} [2024-06-21 19:52:04,132 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 84 predicate places. [2024-06-21 19:52:04,132 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 274 transitions, 3345 flow [2024-06-21 19:52:04,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:52:04,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:04,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:04,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-21 19:52:04,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:04,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1568710441, now seen corresponding path program 3 times [2024-06-21 19:52:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:04,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182801970] [2024-06-21 19:52:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:52:10,329 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-21 19:52:10,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:52:10,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182801970] [2024-06-21 19:52:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182801970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:52:10,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:52:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:52:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463949912] [2024-06-21 19:52:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:52:10,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:52:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:52:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:52:10,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:52:10,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:52:10,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 274 transitions, 3345 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:52:10,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:52:10,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:52:10,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:14,317 INFO L124 PetriNetUnfolderBase]: 8594/12259 cut-off events. [2024-06-21 19:52:14,318 INFO L125 PetriNetUnfolderBase]: For 205961/206472 co-relation queries the response was YES. [2024-06-21 19:52:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75331 conditions, 12259 events. 8594/12259 cut-off events. For 205961/206472 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 70036 event pairs, 3483 based on Foata normal form. 94/11927 useless extension candidates. Maximal degree in co-relation 75270. Up to 10677 conditions per place. [2024-06-21 19:52:14,416 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 202 selfloop transitions, 132 changer transitions 0/367 dead transitions. [2024-06-21 19:52:14,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 367 transitions, 4391 flow [2024-06-21 19:52:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-21 19:52:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-21 19:52:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 318 transitions. [2024-06-21 19:52:14,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-21 19:52:14,427 INFO L175 Difference]: Start difference. First operand has 141 places, 274 transitions, 3345 flow. Second operand 12 states and 318 transitions. [2024-06-21 19:52:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 367 transitions, 4391 flow [2024-06-21 19:52:14,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 367 transitions, 4226 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-21 19:52:14,723 INFO L231 Difference]: Finished difference. Result has 147 places, 276 transitions, 3504 flow [2024-06-21 19:52:14,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3504, PETRI_PLACES=147, PETRI_TRANSITIONS=276} [2024-06-21 19:52:14,724 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 90 predicate places. [2024-06-21 19:52:14,724 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 276 transitions, 3504 flow [2024-06-21 19:52:14,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:52:14,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:14,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:14,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-21 19:52:14,725 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:14,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1117257859, now seen corresponding path program 4 times [2024-06-21 19:52:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034693874] [2024-06-21 19:52:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:52:19,503 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-21 19:52:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:52:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034693874] [2024-06-21 19:52:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034693874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:52:19,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:52:19,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:52:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662557542] [2024-06-21 19:52:19,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:52:19,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:52:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:52:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:52:19,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:52:19,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-21 19:52:19,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 276 transitions, 3504 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:52:19,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:52:19,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-21 19:52:19,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:23,423 INFO L124 PetriNetUnfolderBase]: 8748/12509 cut-off events. [2024-06-21 19:52:23,423 INFO L125 PetriNetUnfolderBase]: For 227982/228626 co-relation queries the response was YES. [2024-06-21 19:52:23,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77493 conditions, 12509 events. 8748/12509 cut-off events. For 227982/228626 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 72077 event pairs, 2841 based on Foata normal form. 179/12220 useless extension candidates. Maximal degree in co-relation 77430. Up to 10655 conditions per place. [2024-06-21 19:52:23,518 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 170 selfloop transitions, 127 changer transitions 0/330 dead transitions. [2024-06-21 19:52:23,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 330 transitions, 4382 flow [2024-06-21 19:52:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 19:52:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 19:52:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-21 19:52:23,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-21 19:52:23,524 INFO L175 Difference]: Start difference. First operand has 147 places, 276 transitions, 3504 flow. Second operand 8 states and 208 transitions. [2024-06-21 19:52:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 330 transitions, 4382 flow [2024-06-21 19:52:23,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 330 transitions, 4114 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-21 19:52:23,740 INFO L231 Difference]: Finished difference. Result has 145 places, 282 transitions, 3627 flow [2024-06-21 19:52:23,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3242, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3627, PETRI_PLACES=145, PETRI_TRANSITIONS=282} [2024-06-21 19:52:23,741 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2024-06-21 19:52:23,741 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 282 transitions, 3627 flow [2024-06-21 19:52:23,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 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-21 19:52:23,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:23,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-21 19:52:23,741 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:23,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1928324441, now seen corresponding path program 1 times [2024-06-21 19:52:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948669968] [2024-06-21 19:52:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:52:30,372 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-21 19:52:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:52:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948669968] [2024-06-21 19:52:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948669968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:52:30,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:52:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-21 19:52:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700166485] [2024-06-21 19:52:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:52:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-21 19:52:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:52:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-21 19:52:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-21 19:52:30,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:52:30,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 282 transitions, 3627 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:52:30,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:52:30,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:52:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:34,449 INFO L124 PetriNetUnfolderBase]: 9184/13028 cut-off events. [2024-06-21 19:52:34,449 INFO L125 PetriNetUnfolderBase]: For 200661/201226 co-relation queries the response was YES. [2024-06-21 19:52:34,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79083 conditions, 13028 events. 9184/13028 cut-off events. For 200661/201226 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 72967 event pairs, 3137 based on Foata normal form. 111/13098 useless extension candidates. Maximal degree in co-relation 79019. Up to 12250 conditions per place. [2024-06-21 19:52:34,563 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 283 selfloop transitions, 37 changer transitions 0/328 dead transitions. [2024-06-21 19:52:34,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 328 transitions, 4446 flow [2024-06-21 19:52:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-21 19:52:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-21 19:52:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-21 19:52:34,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-06-21 19:52:34,566 INFO L175 Difference]: Start difference. First operand has 145 places, 282 transitions, 3627 flow. Second operand 8 states and 196 transitions. [2024-06-21 19:52:34,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 328 transitions, 4446 flow [2024-06-21 19:52:34,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 328 transitions, 4223 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-21 19:52:34,836 INFO L231 Difference]: Finished difference. Result has 147 places, 285 transitions, 3536 flow [2024-06-21 19:52:34,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3404, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3536, PETRI_PLACES=147, PETRI_TRANSITIONS=285} [2024-06-21 19:52:34,837 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 90 predicate places. [2024-06-21 19:52:34,837 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 285 transitions, 3536 flow [2024-06-21 19:52:34,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-21 19:52:34,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:34,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:34,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-21 19:52:34,837 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:34,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash -899106767, now seen corresponding path program 1 times [2024-06-21 19:52:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543934949] [2024-06-21 19:52:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:52:38,919 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-21 19:52:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:52:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543934949] [2024-06-21 19:52:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543934949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:52:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:52:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-21 19:52:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698546268] [2024-06-21 19:52:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:52:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-21 19:52:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:52:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-21 19:52:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-21 19:52:38,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-21 19:52:38,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 285 transitions, 3536 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-21 19:52:38,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:52:38,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-21 19:52:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:42,903 INFO L124 PetriNetUnfolderBase]: 10525/14754 cut-off events. [2024-06-21 19:52:42,904 INFO L125 PetriNetUnfolderBase]: For 240911/240960 co-relation queries the response was YES. [2024-06-21 19:52:42,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90422 conditions, 14754 events. 10525/14754 cut-off events. For 240911/240960 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 81827 event pairs, 3922 based on Foata normal form. 43/14789 useless extension candidates. Maximal degree in co-relation 90357. Up to 14047 conditions per place. [2024-06-21 19:52:43,029 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 306 selfloop transitions, 39 changer transitions 0/352 dead transitions. [2024-06-21 19:52:43,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 352 transitions, 4880 flow [2024-06-21 19:52:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-21 19:52:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-21 19:52:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-21 19:52:43,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-06-21 19:52:43,031 INFO L175 Difference]: Start difference. First operand has 147 places, 285 transitions, 3536 flow. Second operand 6 states and 147 transitions. [2024-06-21 19:52:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 352 transitions, 4880 flow [2024-06-21 19:52:43,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 352 transitions, 4748 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-21 19:52:43,333 INFO L231 Difference]: Finished difference. Result has 149 places, 320 transitions, 4086 flow [2024-06-21 19:52:43,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4086, PETRI_PLACES=149, PETRI_TRANSITIONS=320} [2024-06-21 19:52:43,333 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 92 predicate places. [2024-06-21 19:52:43,333 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 320 transitions, 4086 flow [2024-06-21 19:52:43,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-21 19:52:43,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:43,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:43,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-21 19:52:43,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:43,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash -418645331, now seen corresponding path program 1 times [2024-06-21 19:52:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:43,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893831365] [2024-06-21 19:52:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:52:50,987 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-21 19:52:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:52:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893831365] [2024-06-21 19:52:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893831365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:52:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:52:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:52:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094751941] [2024-06-21 19:52:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:52:50,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:52:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:52:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:52:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:52:51,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:52:51,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 320 transitions, 4086 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:52:51,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:52:51,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:52:51,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:52:55,388 INFO L124 PetriNetUnfolderBase]: 10269/14622 cut-off events. [2024-06-21 19:52:55,388 INFO L125 PetriNetUnfolderBase]: For 265293/265736 co-relation queries the response was YES. [2024-06-21 19:52:55,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93459 conditions, 14622 events. 10269/14622 cut-off events. For 265293/265736 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 84821 event pairs, 3008 based on Foata normal form. 121/14664 useless extension candidates. Maximal degree in co-relation 93390. Up to 12881 conditions per place. [2024-06-21 19:52:55,528 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 363 selfloop transitions, 74 changer transitions 0/448 dead transitions. [2024-06-21 19:52:55,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 448 transitions, 5802 flow [2024-06-21 19:52:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 19:52:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 19:52:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 296 transitions. [2024-06-21 19:52:55,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2024-06-21 19:52:55,531 INFO L175 Difference]: Start difference. First operand has 149 places, 320 transitions, 4086 flow. Second operand 11 states and 296 transitions. [2024-06-21 19:52:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 448 transitions, 5802 flow [2024-06-21 19:52:56,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 448 transitions, 5768 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-06-21 19:52:56,101 INFO L231 Difference]: Finished difference. Result has 163 places, 348 transitions, 4658 flow [2024-06-21 19:52:56,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4053, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4658, PETRI_PLACES=163, PETRI_TRANSITIONS=348} [2024-06-21 19:52:56,102 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 106 predicate places. [2024-06-21 19:52:56,102 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 348 transitions, 4658 flow [2024-06-21 19:52:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:52:56,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:52:56,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:52:56,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-21 19:52:56,103 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:52:56,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:52:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2095720109, now seen corresponding path program 2 times [2024-06-21 19:52:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:52:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901567918] [2024-06-21 19:52:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:52:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:52:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:53:02,593 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-21 19:53:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:53:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901567918] [2024-06-21 19:53:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901567918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:53:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:53:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:53:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359978505] [2024-06-21 19:53:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:53:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:53:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:53:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:53:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:53:02,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:53:02,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 348 transitions, 4658 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:02,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:53:02,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:53:02,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:53:07,754 INFO L124 PetriNetUnfolderBase]: 11112/15876 cut-off events. [2024-06-21 19:53:07,754 INFO L125 PetriNetUnfolderBase]: For 315372/315910 co-relation queries the response was YES. [2024-06-21 19:53:07,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103729 conditions, 15876 events. 11112/15876 cut-off events. For 315372/315910 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 94001 event pairs, 3899 based on Foata normal form. 131/15942 useless extension candidates. Maximal degree in co-relation 103653. Up to 14071 conditions per place. [2024-06-21 19:53:07,916 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 382 selfloop transitions, 72 changer transitions 0/465 dead transitions. [2024-06-21 19:53:07,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 465 transitions, 6243 flow [2024-06-21 19:53:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-21 19:53:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-21 19:53:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 334 transitions. [2024-06-21 19:53:07,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757834757834758 [2024-06-21 19:53:07,932 INFO L175 Difference]: Start difference. First operand has 163 places, 348 transitions, 4658 flow. Second operand 13 states and 334 transitions. [2024-06-21 19:53:07,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 465 transitions, 6243 flow [2024-06-21 19:53:08,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 465 transitions, 6063 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-06-21 19:53:08,454 INFO L231 Difference]: Finished difference. Result has 175 places, 365 transitions, 4898 flow [2024-06-21 19:53:08,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4898, PETRI_PLACES=175, PETRI_TRANSITIONS=365} [2024-06-21 19:53:08,455 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 118 predicate places. [2024-06-21 19:53:08,455 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 365 transitions, 4898 flow [2024-06-21 19:53:08,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:08,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:53:08,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:53:08,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-21 19:53:08,456 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:53:08,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:53:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash 510416869, now seen corresponding path program 3 times [2024-06-21 19:53:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:53:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379540950] [2024-06-21 19:53:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:53:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:53:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:53:14,763 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-21 19:53:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:53:14,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379540950] [2024-06-21 19:53:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379540950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:53:14,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:53:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:53:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008493017] [2024-06-21 19:53:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:53:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:53:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:53:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:53:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:53:14,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:53:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 365 transitions, 4898 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:53:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:53:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:53:19,960 INFO L124 PetriNetUnfolderBase]: 11058/15789 cut-off events. [2024-06-21 19:53:19,960 INFO L125 PetriNetUnfolderBase]: For 330035/330513 co-relation queries the response was YES. [2024-06-21 19:53:20,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104657 conditions, 15789 events. 11058/15789 cut-off events. For 330035/330513 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 93102 event pairs, 4087 based on Foata normal form. 105/15821 useless extension candidates. Maximal degree in co-relation 104576. Up to 14822 conditions per place. [2024-06-21 19:53:20,120 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 388 selfloop transitions, 48 changer transitions 0/447 dead transitions. [2024-06-21 19:53:20,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 447 transitions, 6086 flow [2024-06-21 19:53:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 19:53:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 19:53:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2024-06-21 19:53:20,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205761316872428 [2024-06-21 19:53:20,132 INFO L175 Difference]: Start difference. First operand has 175 places, 365 transitions, 4898 flow. Second operand 9 states and 253 transitions. [2024-06-21 19:53:20,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 447 transitions, 6086 flow [2024-06-21 19:53:20,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 447 transitions, 5989 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-21 19:53:20,786 INFO L231 Difference]: Finished difference. Result has 180 places, 370 transitions, 4997 flow [2024-06-21 19:53:20,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4801, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4997, PETRI_PLACES=180, PETRI_TRANSITIONS=370} [2024-06-21 19:53:20,787 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 123 predicate places. [2024-06-21 19:53:20,787 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 370 transitions, 4997 flow [2024-06-21 19:53:20,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:20,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:53:20,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:53:20,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-21 19:53:20,787 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:53:20,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:53:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1385233261, now seen corresponding path program 4 times [2024-06-21 19:53:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:53:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183853039] [2024-06-21 19:53:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:53:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:53:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:53:27,405 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-21 19:53:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:53:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183853039] [2024-06-21 19:53:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183853039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:53:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:53:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:53:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439811352] [2024-06-21 19:53:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:53:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:53:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:53:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:53:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:53:27,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:53:27,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 370 transitions, 4997 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:27,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:53:27,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:53:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:53:32,756 INFO L124 PetriNetUnfolderBase]: 11214/16043 cut-off events. [2024-06-21 19:53:32,757 INFO L125 PetriNetUnfolderBase]: For 350280/350766 co-relation queries the response was YES. [2024-06-21 19:53:32,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106958 conditions, 16043 events. 11214/16043 cut-off events. For 350280/350766 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 95211 event pairs, 4105 based on Foata normal form. 149/16119 useless extension candidates. Maximal degree in co-relation 106875. Up to 14657 conditions per place. [2024-06-21 19:53:32,893 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 372 selfloop transitions, 79 changer transitions 0/462 dead transitions. [2024-06-21 19:53:32,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 462 transitions, 6266 flow [2024-06-21 19:53:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-21 19:53:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-21 19:53:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 290 transitions. [2024-06-21 19:53:32,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2024-06-21 19:53:32,895 INFO L175 Difference]: Start difference. First operand has 180 places, 370 transitions, 4997 flow. Second operand 11 states and 290 transitions. [2024-06-21 19:53:32,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 462 transitions, 6266 flow [2024-06-21 19:53:33,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 462 transitions, 6186 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-21 19:53:33,453 INFO L231 Difference]: Finished difference. Result has 188 places, 375 transitions, 5188 flow [2024-06-21 19:53:33,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4917, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5188, PETRI_PLACES=188, PETRI_TRANSITIONS=375} [2024-06-21 19:53:33,454 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 131 predicate places. [2024-06-21 19:53:33,454 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 375 transitions, 5188 flow [2024-06-21 19:53:33,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:33,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:53:33,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:53:33,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-21 19:53:33,454 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:53:33,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:53:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1385381131, now seen corresponding path program 5 times [2024-06-21 19:53:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:53:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198855695] [2024-06-21 19:53:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:53:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:53:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:53:41,129 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-21 19:53:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:53:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198855695] [2024-06-21 19:53:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198855695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:53:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:53:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:53:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629698288] [2024-06-21 19:53:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:53:41,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:53:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:53:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:53:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:53:41,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:53:41,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 375 transitions, 5188 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:41,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:53:41,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:53:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:53:46,423 INFO L124 PetriNetUnfolderBase]: 11749/16830 cut-off events. [2024-06-21 19:53:46,423 INFO L125 PetriNetUnfolderBase]: For 390524/391009 co-relation queries the response was YES. [2024-06-21 19:53:46,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113097 conditions, 16830 events. 11749/16830 cut-off events. For 390524/391009 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 100856 event pairs, 3994 based on Foata normal form. 173/16938 useless extension candidates. Maximal degree in co-relation 113010. Up to 13864 conditions per place. [2024-06-21 19:53:46,647 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 351 selfloop transitions, 124 changer transitions 0/486 dead transitions. [2024-06-21 19:53:46,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 486 transitions, 6660 flow [2024-06-21 19:53:46,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-21 19:53:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-21 19:53:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 343 transitions. [2024-06-21 19:53:46,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4886039886039886 [2024-06-21 19:53:46,654 INFO L175 Difference]: Start difference. First operand has 188 places, 375 transitions, 5188 flow. Second operand 13 states and 343 transitions. [2024-06-21 19:53:46,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 486 transitions, 6660 flow [2024-06-21 19:53:47,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 486 transitions, 6478 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-21 19:53:47,569 INFO L231 Difference]: Finished difference. Result has 195 places, 380 transitions, 5381 flow [2024-06-21 19:53:47,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5006, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5381, PETRI_PLACES=195, PETRI_TRANSITIONS=380} [2024-06-21 19:53:47,570 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places. [2024-06-21 19:53:47,570 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 380 transitions, 5381 flow [2024-06-21 19:53:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:47,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:53:47,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:53:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-21 19:53:47,571 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:53:47,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:53:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 275405415, now seen corresponding path program 6 times [2024-06-21 19:53:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:53:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155131722] [2024-06-21 19:53:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:53:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:53:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:53:53,609 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-21 19:53:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:53:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155131722] [2024-06-21 19:53:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155131722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:53:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:53:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:53:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742383359] [2024-06-21 19:53:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:53:53,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:53:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:53:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:53:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:53:53,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:53:53,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 380 transitions, 5381 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:53:53,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:53:53,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:53:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:53:59,576 INFO L124 PetriNetUnfolderBase]: 12402/17770 cut-off events. [2024-06-21 19:53:59,576 INFO L125 PetriNetUnfolderBase]: For 443504/443979 co-relation queries the response was YES. [2024-06-21 19:53:59,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121465 conditions, 17770 events. 12402/17770 cut-off events. For 443504/443979 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 106396 event pairs, 3999 based on Foata normal form. 184/17876 useless extension candidates. Maximal degree in co-relation 121376. Up to 15934 conditions per place. [2024-06-21 19:53:59,747 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 321 selfloop transitions, 112 changer transitions 0/444 dead transitions. [2024-06-21 19:53:59,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 444 transitions, 6599 flow [2024-06-21 19:53:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 19:53:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 19:53:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-21 19:53:59,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711934156378601 [2024-06-21 19:53:59,765 INFO L175 Difference]: Start difference. First operand has 195 places, 380 transitions, 5381 flow. Second operand 9 states and 229 transitions. [2024-06-21 19:53:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 444 transitions, 6599 flow [2024-06-21 19:54:00,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 444 transitions, 6422 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-21 19:54:00,527 INFO L231 Difference]: Finished difference. Result has 194 places, 382 transitions, 5487 flow [2024-06-21 19:54:00,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5487, PETRI_PLACES=194, PETRI_TRANSITIONS=382} [2024-06-21 19:54:00,528 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 137 predicate places. [2024-06-21 19:54:00,528 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 382 transitions, 5487 flow [2024-06-21 19:54:00,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:54:00,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:54:00,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:54:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-21 19:54:00,529 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:54:00,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:54:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 465143469, now seen corresponding path program 7 times [2024-06-21 19:54:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:54:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140908265] [2024-06-21 19:54:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:54:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:54:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:54:06,617 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-21 19:54:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:54:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140908265] [2024-06-21 19:54:06,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140908265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:54:06,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:54:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:54:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870371898] [2024-06-21 19:54:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:54:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:54:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:54:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:54:06,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:54:06,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:54:06,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 382 transitions, 5487 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:54:06,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:54:06,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:54:06,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-21 19:54:13,093 INFO L124 PetriNetUnfolderBase]: 13232/18975 cut-off events. [2024-06-21 19:54:13,094 INFO L125 PetriNetUnfolderBase]: For 460904/461379 co-relation queries the response was YES. [2024-06-21 19:54:13,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129539 conditions, 18975 events. 13232/18975 cut-off events. For 460904/461379 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 114940 event pairs, 4124 based on Foata normal form. 184/19079 useless extension candidates. Maximal degree in co-relation 129449. Up to 15405 conditions per place. [2024-06-21 19:54:13,279 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 336 selfloop transitions, 116 changer transitions 0/463 dead transitions. [2024-06-21 19:54:13,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 463 transitions, 7030 flow [2024-06-21 19:54:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-21 19:54:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-21 19:54:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-21 19:54:13,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49176954732510286 [2024-06-21 19:54:13,281 INFO L175 Difference]: Start difference. First operand has 194 places, 382 transitions, 5487 flow. Second operand 9 states and 239 transitions. [2024-06-21 19:54:13,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 463 transitions, 7030 flow [2024-06-21 19:54:14,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 463 transitions, 6810 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-21 19:54:14,066 INFO L231 Difference]: Finished difference. Result has 197 places, 389 transitions, 5677 flow [2024-06-21 19:54:14,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5267, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5677, PETRI_PLACES=197, PETRI_TRANSITIONS=389} [2024-06-21 19:54:14,067 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 140 predicate places. [2024-06-21 19:54:14,067 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 389 transitions, 5677 flow [2024-06-21 19:54:14,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:54:14,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-21 19:54:14,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-21 19:54:14,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-21 19:54:14,067 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-21 19:54:14,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-21 19:54:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 470653719, now seen corresponding path program 8 times [2024-06-21 19:54:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-21 19:54:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938895237] [2024-06-21 19:54:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-21 19:54:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-21 19:54:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-21 19:54:20,230 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-21 19:54:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-21 19:54:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938895237] [2024-06-21 19:54:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938895237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-21 19:54:20,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-21 19:54:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-21 19:54:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385665296] [2024-06-21 19:54:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-21 19:54:20,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-21 19:54:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-21 19:54:20,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-21 19:54:20,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-21 19:54:20,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-21 19:54:20,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 389 transitions, 5677 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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-21 19:54:20,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-21 19:54:20,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-21 19:54:20,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand