./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.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-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/safe031_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 19:59:42,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:59:42,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:59:42,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:59:42,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:59:42,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:59:42,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:59:42,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:59:42,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:59:42,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:59:42,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:59:42,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:59:42,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:59:42,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:59:42,406 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:59:42,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:59:42,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:59:42,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:59:42,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:59:42,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:59:42,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:59:42,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:59:42,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:59:42,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:59:42,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:59:42,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:59:42,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:59:42,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:59:42,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:59:42,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:59:42,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:59:42,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:59:42,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:59:42,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:59:42,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:59:42,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:59:42,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:59:42,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:59:42,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:59:42,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:59:42,414 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:59:42,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:59:42,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:59:42,415 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-20 19:59:42,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:59:42,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:59:42,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:59:42,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:59:42,688 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:59:42,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:59:43,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:59:44,085 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:59:44,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:59:44,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4718976/05d6a19f2e544165a4a896ff73413e62/FLAG771324f25 [2024-06-20 19:59:44,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4718976/05d6a19f2e544165a4a896ff73413e62 [2024-06-20 19:59:44,117 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:59:44,118 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:59:44,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-20 19:59:44,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:59:44,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:59:44,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:59:44,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:59:44,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:59:44,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:59:44" (1/2) ... [2024-06-20 19:59:44,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e4442a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:59:44, skipping insertion in model container [2024-06-20 19:59:44,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:59:44" (1/2) ... [2024-06-20 19:59:44,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77ad10fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:59:44, skipping insertion in model container [2024-06-20 19:59:44,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:59:44" (2/2) ... [2024-06-20 19:59:44,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e4442a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:44, skipping insertion in model container [2024-06-20 19:59:44,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:59:44" (2/2) ... [2024-06-20 19:59:44,340 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:59:44,430 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:59:44,432 INFO L97 edCorrectnessWitness]: Location invariant before [L832-L832] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-20 19:59:44,433 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-20 19:59:44,433 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-20 19:59:44,434 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:59:44,434 INFO L106 edCorrectnessWitness]: ghost_update [L830-L830] multithreaded = 1; [2024-06-20 19:59:44,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:59:44,796 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:59:44,813 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:59:45,206 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:59:45,249 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:59:45,250 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45 WrapperNode [2024-06-20 19:59:45,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:59:45,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:59:45,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:59:45,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:59:45,258 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 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,301 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 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,435 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124 [2024-06-20 19:59:45,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:59:45,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:59:45,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:59:45,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:59:45,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 19:59:45,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:59:45,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:59:45,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:59:45,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:59:45,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (1/1) ... [2024-06-20 19:59:45,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:59:45,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:59:45,865 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-20 19:59:45,893 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-20 19:59:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:59:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:59:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:59:45,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:59:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:59:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:59:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 19:59:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 19:59:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:59:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:59:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:59:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:59:45,917 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:59:46,080 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:59:46,083 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:59:47,477 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:59:47,478 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:59:47,829 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:59:47,829 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:59:47,830 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:59:47 BoogieIcfgContainer [2024-06-20 19:59:47,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:59:47,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:59:47,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:59:47,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:59:47,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:59:44" (1/4) ... [2024-06-20 19:59:47,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bc5759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:59:47, skipping insertion in model container [2024-06-20 19:59:47,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:59:44" (2/4) ... [2024-06-20 19:59:47,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bc5759 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:59:47, skipping insertion in model container [2024-06-20 19:59:47,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:59:45" (3/4) ... [2024-06-20 19:59:47,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bc5759 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:59:47, skipping insertion in model container [2024-06-20 19:59:47,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:59:47" (4/4) ... [2024-06-20 19:59:47,839 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:59:47,855 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:59:47,856 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 19:59:47,856 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:59:48,024 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:59:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 19:59:48,115 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-20 19:59:48,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:59:48,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:59:48,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 19:59:48,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-20 19:59:48,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:59:48,142 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;@5c0c854d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:59:48,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 19:59:48,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:59:48,153 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:59:48,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:59:48,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:48,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:59:48,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:59:48,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash 362273232, now seen corresponding path program 1 times [2024-06-20 19:59:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:48,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306962090] [2024-06-20 19:59:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:53,944 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-20 19:59:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306962090] [2024-06-20 19:59:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306962090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:53,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:59:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982937240] [2024-06-20 19:59:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:59:53,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:59:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:59:54,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:59:54,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:54,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:54,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:59:54,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:55,195 INFO L124 PetriNetUnfolderBase]: 1359/2057 cut-off events. [2024-06-20 19:59:55,195 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-20 19:59:55,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 2057 events. 1359/2057 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9805 event pairs, 941 based on Foata normal form. 1/2021 useless extension candidates. Maximal degree in co-relation 4159. Up to 2029 conditions per place. [2024-06-20 19:59:55,215 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-20 19:59:55,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-20 19:59:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:59:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:59:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-20 19:59:55,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-20 19:59:55,231 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions. [2024-06-20 19:59:55,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-20 19:59:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 19:59:55,236 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-20 19:59:55,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-20 19:59:55,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-20 19:59:55,241 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-20 19:59:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:55,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:55,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:59:55,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:59:55,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 252269935, now seen corresponding path program 1 times [2024-06-20 19:59:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381786136] [2024-06-20 19:59:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:59,505 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-20 19:59:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381786136] [2024-06-20 19:59:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381786136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:59,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:59:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537666744] [2024-06-20 19:59:59,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:59,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:59:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:59:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:59:59,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:59:59,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:59,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:59,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:59:59,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:00,646 INFO L124 PetriNetUnfolderBase]: 1353/2048 cut-off events. [2024-06-20 20:00:00,646 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2024-06-20 20:00:00,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4704 conditions, 2048 events. 1353/2048 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9794 event pairs, 795 based on Foata normal form. 3/2048 useless extension candidates. Maximal degree in co-relation 4692. Up to 2005 conditions per place. [2024-06-20 20:00:00,658 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-20 20:00:00,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 238 flow [2024-06-20 20:00:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 20:00:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 20:00:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-20 20:00:00,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-06-20 20:00:00,661 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 97 transitions. [2024-06-20 20:00:00,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 238 flow [2024-06-20 20:00:00,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 20:00:00,663 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-20 20:00:00,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-20 20:00:00,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-20 20:00:00,665 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-20 20:00:00,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:00,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:00,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:00,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 20:00:00,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:00,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1913285902, now seen corresponding path program 1 times [2024-06-20 20:00:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079832465] [2024-06-20 20:00:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:06,096 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-20 20:00:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079832465] [2024-06-20 20:00:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079832465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:06,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 20:00:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280362796] [2024-06-20 20:00:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:06,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 20:00:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 20:00:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 20:00:06,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 20:00:06,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:06,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:06,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 20:00:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:07,336 INFO L124 PetriNetUnfolderBase]: 1347/2039 cut-off events. [2024-06-20 20:00:07,336 INFO L125 PetriNetUnfolderBase]: For 1137/1137 co-relation queries the response was YES. [2024-06-20 20:00:07,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2039 events. 1347/2039 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9767 event pairs, 649 based on Foata normal form. 3/2039 useless extension candidates. Maximal degree in co-relation 5206. Up to 1981 conditions per place. [2024-06-20 20:00:07,350 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 46 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-06-20 20:00:07,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 316 flow [2024-06-20 20:00:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 20:00:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 20:00:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-20 20:00:07,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5804878048780487 [2024-06-20 20:00:07,381 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 119 transitions. [2024-06-20 20:00:07,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 316 flow [2024-06-20 20:00:07,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 302 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 20:00:07,386 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 172 flow [2024-06-20 20:00:07,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-20 20:00:07,387 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-06-20 20:00:07,387 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 172 flow [2024-06-20 20:00:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:07,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:07,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 20:00:07,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:07,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1773666863, now seen corresponding path program 1 times [2024-06-20 20:00:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079564827] [2024-06-20 20:00:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:14,483 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-20 20:00:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079564827] [2024-06-20 20:00:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079564827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 20:00:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287829298] [2024-06-20 20:00:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 20:00:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 20:00:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 20:00:14,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:14,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:14,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:14,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:15,680 INFO L124 PetriNetUnfolderBase]: 1342/2032 cut-off events. [2024-06-20 20:00:15,680 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-06-20 20:00:15,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2032 events. 1342/2032 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9675 event pairs, 631 based on Foata normal form. 2/2031 useless extension candidates. Maximal degree in co-relation 5713. Up to 1995 conditions per place. [2024-06-20 20:00:15,696 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 41 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-20 20:00:15,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 324 flow [2024-06-20 20:00:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:00:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:00:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-20 20:00:15,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-20 20:00:15,698 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 172 flow. Second operand 6 states and 107 transitions. [2024-06-20 20:00:15,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 324 flow [2024-06-20 20:00:15,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 298 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 20:00:15,702 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 209 flow [2024-06-20 20:00:15,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-20 20:00:15,704 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-06-20 20:00:15,704 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 209 flow [2024-06-20 20:00:15,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:15,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:15,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:15,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 20:00:15,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:15,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash 421798061, now seen corresponding path program 1 times [2024-06-20 20:00:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854563272] [2024-06-20 20:00:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:20,597 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-20 20:00:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854563272] [2024-06-20 20:00:20,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854563272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:20,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:20,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 20:00:20,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075325148] [2024-06-20 20:00:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:20,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 20:00:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 20:00:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-20 20:00:20,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 20:00:20,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:20,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:20,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 20:00:20,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:21,799 INFO L124 PetriNetUnfolderBase]: 1333/2017 cut-off events. [2024-06-20 20:00:21,799 INFO L125 PetriNetUnfolderBase]: For 3143/3143 co-relation queries the response was YES. [2024-06-20 20:00:21,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 2017 events. 1333/2017 cut-off events. For 3143/3143 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9625 event pairs, 467 based on Foata normal form. 6/2020 useless extension candidates. Maximal degree in co-relation 6138. Up to 1929 conditions per place. [2024-06-20 20:00:21,812 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-06-20 20:00:21,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 419 flow [2024-06-20 20:00:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:00:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:00:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-20 20:00:21,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2024-06-20 20:00:21,816 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 209 flow. Second operand 6 states and 137 transitions. [2024-06-20 20:00:21,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 419 flow [2024-06-20 20:00:21,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 397 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 20:00:21,820 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 234 flow [2024-06-20 20:00:21,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-20 20:00:21,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-20 20:00:21,821 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 234 flow [2024-06-20 20:00:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:21,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:21,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:21,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 20:00:21,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:21,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash 850903388, now seen corresponding path program 1 times [2024-06-20 20:00:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587547392] [2024-06-20 20:00:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00: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-20 20:00:28,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587547392] [2024-06-20 20:00:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587547392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:00:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369076274] [2024-06-20 20:00:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:28,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:00:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:00:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:00:28,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:28,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:28,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:28,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:29,248 INFO L124 PetriNetUnfolderBase]: 1335/2020 cut-off events. [2024-06-20 20:00:29,248 INFO L125 PetriNetUnfolderBase]: For 4349/4349 co-relation queries the response was YES. [2024-06-20 20:00:29,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6535 conditions, 2020 events. 1335/2020 cut-off events. For 4349/4349 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9563 event pairs, 569 based on Foata normal form. 3/2020 useless extension candidates. Maximal degree in co-relation 6516. Up to 1955 conditions per place. [2024-06-20 20:00:29,260 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 51 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2024-06-20 20:00:29,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 486 flow [2024-06-20 20:00:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:00:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:00:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-20 20:00:29,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-20 20:00:29,265 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 234 flow. Second operand 6 states and 118 transitions. [2024-06-20 20:00:29,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 486 flow [2024-06-20 20:00:29,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 449 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 20:00:29,272 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 325 flow [2024-06-20 20:00:29,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2024-06-20 20:00:29,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-20 20:00:29,276 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 325 flow [2024-06-20 20:00:29,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:29,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:29,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 20:00:29,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:29,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2011686372, now seen corresponding path program 1 times [2024-06-20 20:00:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844368186] [2024-06-20 20:00:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:35,048 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-20 20:00:35,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:35,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844368186] [2024-06-20 20:00:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844368186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:35,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:00:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41911749] [2024-06-20 20:00:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:00:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:00:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:00:35,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:35,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:35,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:35,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:35,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:36,021 INFO L124 PetriNetUnfolderBase]: 1357/2062 cut-off events. [2024-06-20 20:00:36,022 INFO L125 PetriNetUnfolderBase]: For 6615/6615 co-relation queries the response was YES. [2024-06-20 20:00:36,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7436 conditions, 2062 events. 1357/2062 cut-off events. For 6615/6615 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9698 event pairs, 556 based on Foata normal form. 4/2063 useless extension candidates. Maximal degree in co-relation 7413. Up to 1991 conditions per place. [2024-06-20 20:00:36,036 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-06-20 20:00:36,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 547 flow [2024-06-20 20:00:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:00:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:00:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 20:00:36,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 20:00:36,038 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 325 flow. Second operand 6 states and 116 transitions. [2024-06-20 20:00:36,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 547 flow [2024-06-20 20:00:36,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 531 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-20 20:00:36,044 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 371 flow [2024-06-20 20:00:36,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-06-20 20:00:36,045 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-20 20:00:36,045 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 371 flow [2024-06-20 20:00:36,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:36,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:36,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:36,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 20:00:36,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:36,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 885249948, now seen corresponding path program 2 times [2024-06-20 20:00:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426900085] [2024-06-20 20:00:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:42,412 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-20 20:00:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426900085] [2024-06-20 20:00:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426900085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:00:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326884996] [2024-06-20 20:00:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:00:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:00:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:00:42,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:42,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:42,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:42,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:43,325 INFO L124 PetriNetUnfolderBase]: 1363/2072 cut-off events. [2024-06-20 20:00:43,326 INFO L125 PetriNetUnfolderBase]: For 8620/8620 co-relation queries the response was YES. [2024-06-20 20:00:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 2072 events. 1363/2072 cut-off events. For 8620/8620 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9774 event pairs, 562 based on Foata normal form. 4/2071 useless extension candidates. Maximal degree in co-relation 7976. Up to 1973 conditions per place. [2024-06-20 20:00:43,339 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 60 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-06-20 20:00:43,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 601 flow [2024-06-20 20:00:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:00:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:00:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 20:00:43,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 20:00:43,343 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 371 flow. Second operand 6 states and 116 transitions. [2024-06-20 20:00:43,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 601 flow [2024-06-20 20:00:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 565 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 20:00:43,350 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 411 flow [2024-06-20 20:00:43,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-20 20:00:43,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-20 20:00:43,351 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 411 flow [2024-06-20 20:00:43,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:43,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:43,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:43,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 20:00:43,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:43,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 608202576, now seen corresponding path program 1 times [2024-06-20 20:00:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:43,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561611051] [2024-06-20 20:00:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:49,120 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-20 20:00:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561611051] [2024-06-20 20:00:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561611051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:49,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:49,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:00:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595948001] [2024-06-20 20:00:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:00:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:00:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:00:49,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:49,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 411 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:00:49,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:49,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:49,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:50,103 INFO L124 PetriNetUnfolderBase]: 1365/2079 cut-off events. [2024-06-20 20:00:50,103 INFO L125 PetriNetUnfolderBase]: For 10546/10546 co-relation queries the response was YES. [2024-06-20 20:00:50,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 2079 events. 1365/2079 cut-off events. For 10546/10546 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9931 event pairs, 533 based on Foata normal form. 3/2079 useless extension candidates. Maximal degree in co-relation 8448. Up to 1986 conditions per place. [2024-06-20 20:00:50,114 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 61 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-20 20:00:50,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 691 flow [2024-06-20 20:00:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:00:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:00:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-20 20:00:50,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738675958188153 [2024-06-20 20:00:50,116 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 411 flow. Second operand 7 states and 136 transitions. [2024-06-20 20:00:50,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 691 flow [2024-06-20 20:00:50,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 641 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 20:00:50,124 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 454 flow [2024-06-20 20:00:50,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-20 20:00:50,125 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-20 20:00:50,125 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 454 flow [2024-06-20 20:00:50,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:00:50,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:50,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:50,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 20:00:50,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:50,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1666783547, now seen corresponding path program 1 times [2024-06-20 20:00:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549978837] [2024-06-20 20:00:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:56,600 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-20 20:00:56,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549978837] [2024-06-20 20:00:56,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549978837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:56,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:56,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:00:56,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827211901] [2024-06-20 20:00:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:56,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:00:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:00:56,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:00:56,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:00:56,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 454 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:00:56,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:56,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:00:56,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:57,702 INFO L124 PetriNetUnfolderBase]: 1501/2276 cut-off events. [2024-06-20 20:00:57,702 INFO L125 PetriNetUnfolderBase]: For 13106/13106 co-relation queries the response was YES. [2024-06-20 20:00:57,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9765 conditions, 2276 events. 1501/2276 cut-off events. For 13106/13106 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11032 event pairs, 524 based on Foata normal form. 10/2283 useless extension candidates. Maximal degree in co-relation 9737. Up to 2058 conditions per place. [2024-06-20 20:00:57,715 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 80 selfloop transitions, 29 changer transitions 0/114 dead transitions. [2024-06-20 20:00:57,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 922 flow [2024-06-20 20:00:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:00:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:00:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-20 20:00:57,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519163763066202 [2024-06-20 20:00:57,718 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 454 flow. Second operand 7 states and 149 transitions. [2024-06-20 20:00:57,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 922 flow [2024-06-20 20:00:57,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 859 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 20:00:57,728 INFO L231 Difference]: Finished difference. Result has 73 places, 86 transitions, 637 flow [2024-06-20 20:00:57,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=86} [2024-06-20 20:00:57,729 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-20 20:00:57,729 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 86 transitions, 637 flow [2024-06-20 20:00:57,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:00:57,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:57,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:57,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 20:00:57,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:00:57,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1674135197, now seen corresponding path program 2 times [2024-06-20 20:00:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067538345] [2024-06-20 20:00:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:04,562 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-20 20:01:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067538345] [2024-06-20 20:01:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067538345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:01:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697386972] [2024-06-20 20:01:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:04,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:01:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:01:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:01:04,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:04,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 86 transitions, 637 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:04,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:04,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:04,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:05,649 INFO L124 PetriNetUnfolderBase]: 1725/2624 cut-off events. [2024-06-20 20:01:05,650 INFO L125 PetriNetUnfolderBase]: For 19842/19842 co-relation queries the response was YES. [2024-06-20 20:01:05,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13071 conditions, 2624 events. 1725/2624 cut-off events. For 19842/19842 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13075 event pairs, 573 based on Foata normal form. 10/2629 useless extension candidates. Maximal degree in co-relation 13039. Up to 2022 conditions per place. [2024-06-20 20:01:05,669 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 86 selfloop transitions, 40 changer transitions 0/131 dead transitions. [2024-06-20 20:01:05,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 1225 flow [2024-06-20 20:01:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:01:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:01:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-20 20:01:05,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261324041811847 [2024-06-20 20:01:05,673 INFO L175 Difference]: Start difference. First operand has 73 places, 86 transitions, 637 flow. Second operand 7 states and 151 transitions. [2024-06-20 20:01:05,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 131 transitions, 1225 flow [2024-06-20 20:01:05,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 131 transitions, 1183 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-20 20:01:05,696 INFO L231 Difference]: Finished difference. Result has 81 places, 100 transitions, 857 flow [2024-06-20 20:01:05,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=81, PETRI_TRANSITIONS=100} [2024-06-20 20:01:05,697 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-20 20:01:05,697 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 857 flow [2024-06-20 20:01:05,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:05,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:05,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:05,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 20:01:05,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:05,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1473053387, now seen corresponding path program 3 times [2024-06-20 20:01:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470878576] [2024-06-20 20:01:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:12,504 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-20 20:01:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470878576] [2024-06-20 20:01:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470878576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:01:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657802172] [2024-06-20 20:01:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:12,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:01:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:01:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:01:12,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:12,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 857 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:12,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:12,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:13,879 INFO L124 PetriNetUnfolderBase]: 1805/2741 cut-off events. [2024-06-20 20:01:13,879 INFO L125 PetriNetUnfolderBase]: For 25653/25653 co-relation queries the response was YES. [2024-06-20 20:01:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15050 conditions, 2741 events. 1805/2741 cut-off events. For 25653/25653 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13826 event pairs, 567 based on Foata normal form. 10/2746 useless extension candidates. Maximal degree in co-relation 15013. Up to 2082 conditions per place. [2024-06-20 20:01:13,899 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 82 selfloop transitions, 51 changer transitions 0/138 dead transitions. [2024-06-20 20:01:13,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 138 transitions, 1411 flow [2024-06-20 20:01:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:01:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:01:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-20 20:01:13,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5226480836236934 [2024-06-20 20:01:13,901 INFO L175 Difference]: Start difference. First operand has 81 places, 100 transitions, 857 flow. Second operand 7 states and 150 transitions. [2024-06-20 20:01:13,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 138 transitions, 1411 flow [2024-06-20 20:01:13,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 138 transitions, 1332 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-20 20:01:13,925 INFO L231 Difference]: Finished difference. Result has 88 places, 110 transitions, 1074 flow [2024-06-20 20:01:13,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1074, PETRI_PLACES=88, PETRI_TRANSITIONS=110} [2024-06-20 20:01:13,927 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-20 20:01:13,927 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 1074 flow [2024-06-20 20:01:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:13,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:13,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:13,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 20:01:13,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:13,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1674412027, now seen corresponding path program 1 times [2024-06-20 20:01:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92831313] [2024-06-20 20:01:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:20,790 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-20 20:01:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92831313] [2024-06-20 20:01:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92831313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:01:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455174979] [2024-06-20 20:01:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:20,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:01:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:01:20,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:01:20,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:20,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 110 transitions, 1074 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:20,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:20,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:20,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:22,100 INFO L124 PetriNetUnfolderBase]: 1808/2751 cut-off events. [2024-06-20 20:01:22,101 INFO L125 PetriNetUnfolderBase]: For 29242/29242 co-relation queries the response was YES. [2024-06-20 20:01:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15957 conditions, 2751 events. 1808/2751 cut-off events. For 29242/29242 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13735 event pairs, 612 based on Foata normal form. 6/2754 useless extension candidates. Maximal degree in co-relation 15916. Up to 2581 conditions per place. [2024-06-20 20:01:22,121 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 25 changer transitions 0/138 dead transitions. [2024-06-20 20:01:22,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1500 flow [2024-06-20 20:01:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:01:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:01:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-20 20:01:22,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-20 20:01:22,123 INFO L175 Difference]: Start difference. First operand has 88 places, 110 transitions, 1074 flow. Second operand 8 states and 154 transitions. [2024-06-20 20:01:22,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1500 flow [2024-06-20 20:01:22,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1424 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-20 20:01:22,159 INFO L231 Difference]: Finished difference. Result has 93 places, 113 transitions, 1112 flow [2024-06-20 20:01:22,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1112, PETRI_PLACES=93, PETRI_TRANSITIONS=113} [2024-06-20 20:01:22,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-20 20:01:22,160 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 113 transitions, 1112 flow [2024-06-20 20:01:22,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:22,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:22,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:22,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 20:01:22,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:22,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 887693882, now seen corresponding path program 1 times [2024-06-20 20:01:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216592025] [2024-06-20 20:01:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:31,548 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-20 20:01:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216592025] [2024-06-20 20:01:31,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216592025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:31,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:01:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619461321] [2024-06-20 20:01:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:31,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:01:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:01:31,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:01:31,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:31,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 1112 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:31,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:31,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:32,637 INFO L124 PetriNetUnfolderBase]: 1805/2745 cut-off events. [2024-06-20 20:01:32,637 INFO L125 PetriNetUnfolderBase]: For 30262/30262 co-relation queries the response was YES. [2024-06-20 20:01:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15875 conditions, 2745 events. 1805/2745 cut-off events. For 30262/30262 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13719 event pairs, 642 based on Foata normal form. 1/2743 useless extension candidates. Maximal degree in co-relation 15833. Up to 2650 conditions per place. [2024-06-20 20:01:32,653 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 106 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2024-06-20 20:01:32,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 120 transitions, 1360 flow [2024-06-20 20:01:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 20:01:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 20:01:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-20 20:01:32,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-20 20:01:32,657 INFO L175 Difference]: Start difference. First operand has 93 places, 113 transitions, 1112 flow. Second operand 5 states and 91 transitions. [2024-06-20 20:01:32,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 120 transitions, 1360 flow [2024-06-20 20:01:32,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 120 transitions, 1262 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-20 20:01:32,682 INFO L231 Difference]: Finished difference. Result has 92 places, 113 transitions, 1038 flow [2024-06-20 20:01:32,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=92, PETRI_TRANSITIONS=113} [2024-06-20 20:01:32,683 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-06-20 20:01:32,683 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 113 transitions, 1038 flow [2024-06-20 20:01:32,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:32,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:32,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:32,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 20:01:32,684 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:32,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1757473009, now seen corresponding path program 1 times [2024-06-20 20:01:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791711630] [2024-06-20 20:01:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:39,164 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-20 20:01:39,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791711630] [2024-06-20 20:01:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791711630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:39,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:39,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:01:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936634054] [2024-06-20 20:01:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:39,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:01:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:39,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:01:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:01:39,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:39,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 113 transitions, 1038 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:39,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:39,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:39,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:40,334 INFO L124 PetriNetUnfolderBase]: 1800/2738 cut-off events. [2024-06-20 20:01:40,335 INFO L125 PetriNetUnfolderBase]: For 32746/32746 co-relation queries the response was YES. [2024-06-20 20:01:40,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15746 conditions, 2738 events. 1800/2738 cut-off events. For 32746/32746 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13694 event pairs, 621 based on Foata normal form. 2/2737 useless extension candidates. Maximal degree in co-relation 15703. Up to 2607 conditions per place. [2024-06-20 20:01:40,397 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 120 selfloop transitions, 15 changer transitions 0/140 dead transitions. [2024-06-20 20:01:40,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1426 flow [2024-06-20 20:01:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:01:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:01:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 20:01:40,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-20 20:01:40,400 INFO L175 Difference]: Start difference. First operand has 92 places, 113 transitions, 1038 flow. Second operand 7 states and 135 transitions. [2024-06-20 20:01:40,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1426 flow [2024-06-20 20:01:40,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 140 transitions, 1401 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 20:01:40,426 INFO L231 Difference]: Finished difference. Result has 95 places, 116 transitions, 1109 flow [2024-06-20 20:01:40,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1109, PETRI_PLACES=95, PETRI_TRANSITIONS=116} [2024-06-20 20:01:40,426 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2024-06-20 20:01:40,426 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 116 transitions, 1109 flow [2024-06-20 20:01:40,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 20:01:40,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:40,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:40,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 20:01:40,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:40,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1752704465, now seen corresponding path program 1 times [2024-06-20 20:01:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148669867] [2024-06-20 20:01:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:01:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148669867] [2024-06-20 20:01:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148669867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:01:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115213375] [2024-06-20 20:01:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:47,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:01:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:01:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:01:48,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:48,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 116 transitions, 1109 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:48,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:48,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:48,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:49,307 INFO L124 PetriNetUnfolderBase]: 1864/2834 cut-off events. [2024-06-20 20:01:49,307 INFO L125 PetriNetUnfolderBase]: For 37512/37512 co-relation queries the response was YES. [2024-06-20 20:01:49,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 2834 events. 1864/2834 cut-off events. For 37512/37512 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14266 event pairs, 548 based on Foata normal form. 10/2841 useless extension candidates. Maximal degree in co-relation 16667. Up to 2524 conditions per place. [2024-06-20 20:01:49,325 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 115 selfloop transitions, 35 changer transitions 0/155 dead transitions. [2024-06-20 20:01:49,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 155 transitions, 1679 flow [2024-06-20 20:01:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:01:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:01:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-06-20 20:01:49,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182926829268293 [2024-06-20 20:01:49,327 INFO L175 Difference]: Start difference. First operand has 95 places, 116 transitions, 1109 flow. Second operand 8 states and 170 transitions. [2024-06-20 20:01:49,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 155 transitions, 1679 flow [2024-06-20 20:01:49,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 155 transitions, 1607 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 20:01:49,354 INFO L231 Difference]: Finished difference. Result has 98 places, 122 transitions, 1204 flow [2024-06-20 20:01:49,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1204, PETRI_PLACES=98, PETRI_TRANSITIONS=122} [2024-06-20 20:01:49,354 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-20 20:01:49,354 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 122 transitions, 1204 flow [2024-06-20 20:01:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:49,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:49,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:49,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 20:01:49,355 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:49,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 367155759, now seen corresponding path program 2 times [2024-06-20 20:01:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972909984] [2024-06-20 20:01:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:01:56,634 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-20 20:01:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:01:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972909984] [2024-06-20 20:01:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972909984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:01:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:01:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:01:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806057756] [2024-06-20 20:01:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:01:56,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:01:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:01:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:01:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:01:56,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:01:56,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 122 transitions, 1204 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:56,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:01:56,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:01:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:01:57,883 INFO L124 PetriNetUnfolderBase]: 1936/2975 cut-off events. [2024-06-20 20:01:57,884 INFO L125 PetriNetUnfolderBase]: For 42801/42801 co-relation queries the response was YES. [2024-06-20 20:01:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18390 conditions, 2975 events. 1936/2975 cut-off events. For 42801/42801 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15403 event pairs, 494 based on Foata normal form. 5/2975 useless extension candidates. Maximal degree in co-relation 18346. Up to 2343 conditions per place. [2024-06-20 20:01:57,902 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 142 selfloop transitions, 63 changer transitions 0/210 dead transitions. [2024-06-20 20:01:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 210 transitions, 2519 flow [2024-06-20 20:01:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:01:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:01:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-20 20:01:57,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2024-06-20 20:01:57,904 INFO L175 Difference]: Start difference. First operand has 98 places, 122 transitions, 1204 flow. Second operand 8 states and 171 transitions. [2024-06-20 20:01:57,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 210 transitions, 2519 flow [2024-06-20 20:01:57,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 210 transitions, 2333 flow, removed 51 selfloop flow, removed 6 redundant places. [2024-06-20 20:01:57,937 INFO L231 Difference]: Finished difference. Result has 104 places, 166 transitions, 1842 flow [2024-06-20 20:01:57,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1842, PETRI_PLACES=104, PETRI_TRANSITIONS=166} [2024-06-20 20:01:57,937 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-20 20:01:57,937 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 166 transitions, 1842 flow [2024-06-20 20:01:57,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:01:57,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:01:57,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:01:57,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 20:01:57,938 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:01:57,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:01:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 366859089, now seen corresponding path program 3 times [2024-06-20 20:01:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:01:57,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846486224] [2024-06-20 20:01:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:01:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:01:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:04,997 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-20 20:02:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846486224] [2024-06-20 20:02:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846486224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:04,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:02:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540060369] [2024-06-20 20:02:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:02:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:02:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:02:05,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:05,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 166 transitions, 1842 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:05,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:05,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:05,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:06,405 INFO L124 PetriNetUnfolderBase]: 1976/3035 cut-off events. [2024-06-20 20:02:06,405 INFO L125 PetriNetUnfolderBase]: For 49818/49818 co-relation queries the response was YES. [2024-06-20 20:02:06,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20367 conditions, 3035 events. 1976/3035 cut-off events. For 49818/49818 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15746 event pairs, 494 based on Foata normal form. 5/3033 useless extension candidates. Maximal degree in co-relation 20318. Up to 2512 conditions per place. [2024-06-20 20:02:06,426 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 152 selfloop transitions, 58 changer transitions 0/215 dead transitions. [2024-06-20 20:02:06,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 215 transitions, 2714 flow [2024-06-20 20:02:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:02:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:02:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-20 20:02:06,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152439024390244 [2024-06-20 20:02:06,428 INFO L175 Difference]: Start difference. First operand has 104 places, 166 transitions, 1842 flow. Second operand 8 states and 169 transitions. [2024-06-20 20:02:06,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 215 transitions, 2714 flow [2024-06-20 20:02:06,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 215 transitions, 2652 flow, removed 30 selfloop flow, removed 1 redundant places. [2024-06-20 20:02:06,471 INFO L231 Difference]: Finished difference. Result has 113 places, 176 transitions, 2104 flow [2024-06-20 20:02:06,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2104, PETRI_PLACES=113, PETRI_TRANSITIONS=176} [2024-06-20 20:02:06,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-20 20:02:06,472 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 176 transitions, 2104 flow [2024-06-20 20:02:06,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:06,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:06,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 20:02:06,473 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:06,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1580214575, now seen corresponding path program 4 times [2024-06-20 20:02:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4473020] [2024-06-20 20:02:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:13,632 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-20 20:02:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4473020] [2024-06-20 20:02:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4473020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:02:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204075827] [2024-06-20 20:02:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:02:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:02:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:02:13,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:13,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 176 transitions, 2104 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:13,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:13,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:13,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:14,956 INFO L124 PetriNetUnfolderBase]: 2016/3081 cut-off events. [2024-06-20 20:02:14,956 INFO L125 PetriNetUnfolderBase]: For 56824/56824 co-relation queries the response was YES. [2024-06-20 20:02:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21629 conditions, 3081 events. 2016/3081 cut-off events. For 56824/56824 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15758 event pairs, 528 based on Foata normal form. 10/3084 useless extension candidates. Maximal degree in co-relation 21575. Up to 2340 conditions per place. [2024-06-20 20:02:14,979 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 139 selfloop transitions, 75 changer transitions 0/219 dead transitions. [2024-06-20 20:02:14,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 219 transitions, 2933 flow [2024-06-20 20:02:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:02:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:02:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-20 20:02:14,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2024-06-20 20:02:14,982 INFO L175 Difference]: Start difference. First operand has 113 places, 176 transitions, 2104 flow. Second operand 8 states and 171 transitions. [2024-06-20 20:02:14,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 219 transitions, 2933 flow [2024-06-20 20:02:15,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 219 transitions, 2756 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-20 20:02:15,031 INFO L231 Difference]: Finished difference. Result has 116 places, 184 transitions, 2243 flow [2024-06-20 20:02:15,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2243, PETRI_PLACES=116, PETRI_TRANSITIONS=184} [2024-06-20 20:02:15,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-20 20:02:15,032 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 184 transitions, 2243 flow [2024-06-20 20:02:15,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:15,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:15,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:15,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 20:02:15,032 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:15,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1748707745, now seen corresponding path program 1 times [2024-06-20 20:02:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:15,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158346956] [2024-06-20 20:02:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:25,171 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-20 20:02:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:25,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158346956] [2024-06-20 20:02:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158346956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:02:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020525583] [2024-06-20 20:02:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:25,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:02:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:02:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:02:25,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:25,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 184 transitions, 2243 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:25,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:25,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:25,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:26,530 INFO L124 PetriNetUnfolderBase]: 2030/3099 cut-off events. [2024-06-20 20:02:26,530 INFO L125 PetriNetUnfolderBase]: For 60186/60186 co-relation queries the response was YES. [2024-06-20 20:02:26,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22459 conditions, 3099 events. 2030/3099 cut-off events. For 60186/60186 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15933 event pairs, 584 based on Foata normal form. 6/3094 useless extension candidates. Maximal degree in co-relation 22404. Up to 2877 conditions per place. [2024-06-20 20:02:26,553 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 175 selfloop transitions, 27 changer transitions 0/207 dead transitions. [2024-06-20 20:02:26,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 207 transitions, 2891 flow [2024-06-20 20:02:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:02:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:02:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-20 20:02:26,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2024-06-20 20:02:26,555 INFO L175 Difference]: Start difference. First operand has 116 places, 184 transitions, 2243 flow. Second operand 6 states and 115 transitions. [2024-06-20 20:02:26,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 207 transitions, 2891 flow [2024-06-20 20:02:26,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 207 transitions, 2618 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-20 20:02:26,613 INFO L231 Difference]: Finished difference. Result has 117 places, 194 transitions, 2217 flow [2024-06-20 20:02:26,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2217, PETRI_PLACES=117, PETRI_TRANSITIONS=194} [2024-06-20 20:02:26,614 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-20 20:02:26,614 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 194 transitions, 2217 flow [2024-06-20 20:02:26,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:26,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:26,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:26,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 20:02:26,614 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:26,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash -225762652, now seen corresponding path program 1 times [2024-06-20 20:02:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:26,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061450689] [2024-06-20 20:02:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:33,402 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-20 20:02:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061450689] [2024-06-20 20:02:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061450689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:02:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64059443] [2024-06-20 20:02:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:33,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:02:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:02:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:02:33,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:33,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 194 transitions, 2217 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:33,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:33,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:33,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:34,790 INFO L124 PetriNetUnfolderBase]: 2062/3141 cut-off events. [2024-06-20 20:02:34,790 INFO L125 PetriNetUnfolderBase]: For 64601/64601 co-relation queries the response was YES. [2024-06-20 20:02:34,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22676 conditions, 3141 events. 2062/3141 cut-off events. For 64601/64601 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16068 event pairs, 556 based on Foata normal form. 5/3143 useless extension candidates. Maximal degree in co-relation 22619. Up to 2897 conditions per place. [2024-06-20 20:02:34,814 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 201 selfloop transitions, 37 changer transitions 0/243 dead transitions. [2024-06-20 20:02:34,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 243 transitions, 3179 flow [2024-06-20 20:02:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:02:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:02:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-06-20 20:02:34,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182926829268293 [2024-06-20 20:02:34,816 INFO L175 Difference]: Start difference. First operand has 117 places, 194 transitions, 2217 flow. Second operand 8 states and 170 transitions. [2024-06-20 20:02:34,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 243 transitions, 3179 flow [2024-06-20 20:02:34,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 243 transitions, 3090 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-20 20:02:34,868 INFO L231 Difference]: Finished difference. Result has 125 places, 210 transitions, 2541 flow [2024-06-20 20:02:34,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2541, PETRI_PLACES=125, PETRI_TRANSITIONS=210} [2024-06-20 20:02:34,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-20 20:02:34,869 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 210 transitions, 2541 flow [2024-06-20 20:02:34,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:34,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:34,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:34,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 20:02:34,870 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:34,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1826225104, now seen corresponding path program 1 times [2024-06-20 20:02:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276714708] [2024-06-20 20:02:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:42,255 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-20 20:02:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276714708] [2024-06-20 20:02:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276714708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:02:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716749531] [2024-06-20 20:02:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:42,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:02:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:02:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:02:42,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:42,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 210 transitions, 2541 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:42,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:42,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:42,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:44,031 INFO L124 PetriNetUnfolderBase]: 2162/3311 cut-off events. [2024-06-20 20:02:44,032 INFO L125 PetriNetUnfolderBase]: For 77187/77187 co-relation queries the response was YES. [2024-06-20 20:02:44,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24787 conditions, 3311 events. 2162/3311 cut-off events. For 77187/77187 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17174 event pairs, 537 based on Foata normal form. 17/3325 useless extension candidates. Maximal degree in co-relation 24726. Up to 2944 conditions per place. [2024-06-20 20:02:44,058 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 214 selfloop transitions, 48 changer transitions 0/267 dead transitions. [2024-06-20 20:02:44,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 267 transitions, 3575 flow [2024-06-20 20:02:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:02:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:02:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-20 20:02:44,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-06-20 20:02:44,060 INFO L175 Difference]: Start difference. First operand has 125 places, 210 transitions, 2541 flow. Second operand 9 states and 192 transitions. [2024-06-20 20:02:44,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 267 transitions, 3575 flow [2024-06-20 20:02:44,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 267 transitions, 3411 flow, removed 76 selfloop flow, removed 2 redundant places. [2024-06-20 20:02:44,137 INFO L231 Difference]: Finished difference. Result has 135 places, 226 transitions, 2774 flow [2024-06-20 20:02:44,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2774, PETRI_PLACES=135, PETRI_TRANSITIONS=226} [2024-06-20 20:02:44,138 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-20 20:02:44,138 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 226 transitions, 2774 flow [2024-06-20 20:02:44,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:44,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:44,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:44,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 20:02:44,139 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:44,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1427272503, now seen corresponding path program 1 times [2024-06-20 20:02:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467978210] [2024-06-20 20:02:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:02:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:02:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:02:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467978210] [2024-06-20 20:02:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467978210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:02:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:02:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:02:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88375413] [2024-06-20 20:02:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:02:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:02:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:02:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:02:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:02:54,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:02:54,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 226 transitions, 2774 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:54,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:02:54,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:02:54,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:02:56,314 INFO L124 PetriNetUnfolderBase]: 2172/3323 cut-off events. [2024-06-20 20:02:56,314 INFO L125 PetriNetUnfolderBase]: For 83211/83211 co-relation queries the response was YES. [2024-06-20 20:02:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25700 conditions, 3323 events. 2172/3323 cut-off events. For 83211/83211 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17218 event pairs, 564 based on Foata normal form. 2/3322 useless extension candidates. Maximal degree in co-relation 25633. Up to 3083 conditions per place. [2024-06-20 20:02:56,342 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 205 selfloop transitions, 37 changer transitions 0/247 dead transitions. [2024-06-20 20:02:56,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 247 transitions, 3463 flow [2024-06-20 20:02:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:02:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:02:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-20 20:02:56,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-06-20 20:02:56,344 INFO L175 Difference]: Start difference. First operand has 135 places, 226 transitions, 2774 flow. Second operand 6 states and 122 transitions. [2024-06-20 20:02:56,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 247 transitions, 3463 flow [2024-06-20 20:02:56,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 247 transitions, 3343 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-20 20:02:56,438 INFO L231 Difference]: Finished difference. Result has 138 places, 231 transitions, 2843 flow [2024-06-20 20:02:56,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2843, PETRI_PLACES=138, PETRI_TRANSITIONS=231} [2024-06-20 20:02:56,439 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-20 20:02:56,439 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 231 transitions, 2843 flow [2024-06-20 20:02:56,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:02:56,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:02:56,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:02:56,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 20:02:56,440 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:02:56,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:02:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1768769284, now seen corresponding path program 2 times [2024-06-20 20:02:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:02:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570698039] [2024-06-20 20:02:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:02:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:02:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:03,812 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-20 20:03:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570698039] [2024-06-20 20:03:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570698039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:03,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:03,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:03:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588714083] [2024-06-20 20:03:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:03:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:03:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:03:04,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 231 transitions, 2843 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:05,512 INFO L124 PetriNetUnfolderBase]: 2572/3988 cut-off events. [2024-06-20 20:03:05,512 INFO L125 PetriNetUnfolderBase]: For 121998/121998 co-relation queries the response was YES. [2024-06-20 20:03:05,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29600 conditions, 3988 events. 2572/3988 cut-off events. For 121998/121998 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21683 event pairs, 591 based on Foata normal form. 92/4073 useless extension candidates. Maximal degree in co-relation 29532. Up to 2618 conditions per place. [2024-06-20 20:03:05,544 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 199 selfloop transitions, 79 changer transitions 0/283 dead transitions. [2024-06-20 20:03:05,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 283 transitions, 3922 flow [2024-06-20 20:03:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:03:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:03:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2024-06-20 20:03:05,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311653116531165 [2024-06-20 20:03:05,546 INFO L175 Difference]: Start difference. First operand has 138 places, 231 transitions, 2843 flow. Second operand 9 states and 196 transitions. [2024-06-20 20:03:05,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 283 transitions, 3922 flow [2024-06-20 20:03:05,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 283 transitions, 3831 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-20 20:03:05,631 INFO L231 Difference]: Finished difference. Result has 144 places, 234 transitions, 3011 flow [2024-06-20 20:03:05,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3011, PETRI_PLACES=144, PETRI_TRANSITIONS=234} [2024-06-20 20:03:05,631 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-20 20:03:05,631 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 234 transitions, 3011 flow [2024-06-20 20:03:05,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:05,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:05,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:05,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 20:03:05,632 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:05,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1648985680, now seen corresponding path program 3 times [2024-06-20 20:03:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133348228] [2024-06-20 20:03:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:12,958 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-20 20:03:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133348228] [2024-06-20 20:03:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133348228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:12,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:03:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307138312] [2024-06-20 20:03:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:12,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:03:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:03:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:03:13,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:13,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 234 transitions, 3011 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:13,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:13,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:13,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:15,036 INFO L124 PetriNetUnfolderBase]: 3050/4770 cut-off events. [2024-06-20 20:03:15,036 INFO L125 PetriNetUnfolderBase]: For 148120/148120 co-relation queries the response was YES. [2024-06-20 20:03:15,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35598 conditions, 4770 events. 3050/4770 cut-off events. For 148120/148120 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 27099 event pairs, 688 based on Foata normal form. 97/4860 useless extension candidates. Maximal degree in co-relation 35529. Up to 3179 conditions per place. [2024-06-20 20:03:15,072 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 184 selfloop transitions, 119 changer transitions 0/308 dead transitions. [2024-06-20 20:03:15,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 308 transitions, 4466 flow [2024-06-20 20:03:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:03:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:03:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2024-06-20 20:03:15,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390243902439025 [2024-06-20 20:03:15,074 INFO L175 Difference]: Start difference. First operand has 144 places, 234 transitions, 3011 flow. Second operand 10 states and 221 transitions. [2024-06-20 20:03:15,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 308 transitions, 4466 flow [2024-06-20 20:03:15,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 308 transitions, 4283 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 20:03:15,199 INFO L231 Difference]: Finished difference. Result has 149 places, 255 transitions, 3539 flow [2024-06-20 20:03:15,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2828, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3539, PETRI_PLACES=149, PETRI_TRANSITIONS=255} [2024-06-20 20:03:15,199 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-20 20:03:15,200 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 255 transitions, 3539 flow [2024-06-20 20:03:15,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:15,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:15,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 20:03:15,201 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:15,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1502745574, now seen corresponding path program 4 times [2024-06-20 20:03:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176903184] [2024-06-20 20:03:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:22,556 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-20 20:03:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176903184] [2024-06-20 20:03:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176903184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:03:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238816397] [2024-06-20 20:03:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:03:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:03:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:03:22,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 255 transitions, 3539 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:22,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:22,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:24,824 INFO L124 PetriNetUnfolderBase]: 3697/5827 cut-off events. [2024-06-20 20:03:24,824 INFO L125 PetriNetUnfolderBase]: For 187143/187143 co-relation queries the response was YES. [2024-06-20 20:03:24,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46455 conditions, 5827 events. 3697/5827 cut-off events. For 187143/187143 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34567 event pairs, 862 based on Foata normal form. 18/5838 useless extension candidates. Maximal degree in co-relation 46383. Up to 2395 conditions per place. [2024-06-20 20:03:24,875 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 192 selfloop transitions, 121 changer transitions 0/318 dead transitions. [2024-06-20 20:03:24,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 318 transitions, 5035 flow [2024-06-20 20:03:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:03:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:03:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-20 20:03:24,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501355013550135 [2024-06-20 20:03:24,876 INFO L175 Difference]: Start difference. First operand has 149 places, 255 transitions, 3539 flow. Second operand 9 states and 203 transitions. [2024-06-20 20:03:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 318 transitions, 5035 flow [2024-06-20 20:03:25,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 318 transitions, 4817 flow, removed 78 selfloop flow, removed 4 redundant places. [2024-06-20 20:03:25,098 INFO L231 Difference]: Finished difference. Result has 155 places, 262 transitions, 3817 flow [2024-06-20 20:03:25,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3817, PETRI_PLACES=155, PETRI_TRANSITIONS=262} [2024-06-20 20:03:25,098 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-20 20:03:25,098 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 262 transitions, 3817 flow [2024-06-20 20:03:25,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:25,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:25,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:25,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 20:03:25,099 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:25,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1624648423, now seen corresponding path program 2 times [2024-06-20 20:03:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617187676] [2024-06-20 20:03:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:35,637 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-20 20:03:35,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:35,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617187676] [2024-06-20 20:03:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617187676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:03:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813059536] [2024-06-20 20:03:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:35,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:03:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:03:35,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:03:35,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:35,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 262 transitions, 3817 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:35,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:35,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:35,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:37,693 INFO L124 PetriNetUnfolderBase]: 3671/5782 cut-off events. [2024-06-20 20:03:37,693 INFO L125 PetriNetUnfolderBase]: For 191188/191188 co-relation queries the response was YES. [2024-06-20 20:03:37,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47029 conditions, 5782 events. 3671/5782 cut-off events. For 191188/191188 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34466 event pairs, 1123 based on Foata normal form. 6/5777 useless extension candidates. Maximal degree in co-relation 46954. Up to 5515 conditions per place. [2024-06-20 20:03:37,745 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 233 selfloop transitions, 34 changer transitions 0/272 dead transitions. [2024-06-20 20:03:37,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 272 transitions, 4391 flow [2024-06-20 20:03:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:03:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:03:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-20 20:03:37,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 20:03:37,747 INFO L175 Difference]: Start difference. First operand has 155 places, 262 transitions, 3817 flow. Second operand 6 states and 114 transitions. [2024-06-20 20:03:37,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 272 transitions, 4391 flow [2024-06-20 20:03:37,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 272 transitions, 4116 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-06-20 20:03:37,997 INFO L231 Difference]: Finished difference. Result has 156 places, 262 transitions, 3626 flow [2024-06-20 20:03:37,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3626, PETRI_PLACES=156, PETRI_TRANSITIONS=262} [2024-06-20 20:03:37,997 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-20 20:03:37,997 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 262 transitions, 3626 flow [2024-06-20 20:03:37,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:03:37,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:37,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:37,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 20:03:37,998 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:37,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1433945687, now seen corresponding path program 1 times [2024-06-20 20:03:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397283062] [2024-06-20 20:03:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:03:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397283062] [2024-06-20 20:03:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397283062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:03:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351168574] [2024-06-20 20:03:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:46,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:03:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:03:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:03:46,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:46,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 262 transitions, 3626 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-20 20:03:46,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:46,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:48,008 INFO L124 PetriNetUnfolderBase]: 3673/5785 cut-off events. [2024-06-20 20:03:48,008 INFO L125 PetriNetUnfolderBase]: For 187871/187871 co-relation queries the response was YES. [2024-06-20 20:03:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46675 conditions, 5785 events. 3673/5785 cut-off events. For 187871/187871 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34532 event pairs, 1107 based on Foata normal form. 2/5784 useless extension candidates. Maximal degree in co-relation 46598. Up to 5570 conditions per place. [2024-06-20 20:03:48,065 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 252 selfloop transitions, 20 changer transitions 0/277 dead transitions. [2024-06-20 20:03:48,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 277 transitions, 4294 flow [2024-06-20 20:03:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:03:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:03:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-20 20:03:48,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2024-06-20 20:03:48,066 INFO L175 Difference]: Start difference. First operand has 156 places, 262 transitions, 3626 flow. Second operand 6 states and 113 transitions. [2024-06-20 20:03:48,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 277 transitions, 4294 flow [2024-06-20 20:03:48,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 277 transitions, 4193 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 20:03:48,266 INFO L231 Difference]: Finished difference. Result has 156 places, 265 transitions, 3611 flow [2024-06-20 20:03:48,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3611, PETRI_PLACES=156, PETRI_TRANSITIONS=265} [2024-06-20 20:03:48,267 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-20 20:03:48,267 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 265 transitions, 3611 flow [2024-06-20 20:03:48,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-20 20:03:48,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:48,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:48,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 20:03:48,268 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:48,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2113777735, now seen corresponding path program 2 times [2024-06-20 20:03:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329697738] [2024-06-20 20:03:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:03:55,891 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-20 20:03:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:03:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329697738] [2024-06-20 20:03:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329697738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:03:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:03:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 20:03:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387125588] [2024-06-20 20:03:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:03:55,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 20:03:55,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:03:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 20:03:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 20:03:56,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:03:56,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 265 transitions, 3611 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-20 20:03:56,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:03:56,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:03:56,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:03:57,834 INFO L124 PetriNetUnfolderBase]: 3634/5717 cut-off events. [2024-06-20 20:03:57,834 INFO L125 PetriNetUnfolderBase]: For 193576/193576 co-relation queries the response was YES. [2024-06-20 20:03:57,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46426 conditions, 5717 events. 3634/5717 cut-off events. For 193576/193576 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 34047 event pairs, 1103 based on Foata normal form. 1/5715 useless extension candidates. Maximal degree in co-relation 46348. Up to 5538 conditions per place. [2024-06-20 20:03:57,881 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 256 selfloop transitions, 12 changer transitions 0/273 dead transitions. [2024-06-20 20:03:57,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 273 transitions, 4167 flow [2024-06-20 20:03:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 20:03:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 20:03:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-20 20:03:57,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-20 20:03:57,882 INFO L175 Difference]: Start difference. First operand has 156 places, 265 transitions, 3611 flow. Second operand 6 states and 105 transitions. [2024-06-20 20:03:57,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 273 transitions, 4167 flow [2024-06-20 20:03:58,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 273 transitions, 4136 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 20:03:58,046 INFO L231 Difference]: Finished difference. Result has 159 places, 265 transitions, 3610 flow [2024-06-20 20:03:58,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3610, PETRI_PLACES=159, PETRI_TRANSITIONS=265} [2024-06-20 20:03:58,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-20 20:03:58,047 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 265 transitions, 3610 flow [2024-06-20 20:03:58,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-20 20:03:58,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:03:58,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:03:58,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 20:03:58,047 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:03:58,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:03:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1012234834, now seen corresponding path program 1 times [2024-06-20 20:03:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:03:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278166603] [2024-06-20 20:03:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:03:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:03:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:04,310 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-20 20:04:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278166603] [2024-06-20 20:04:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278166603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:04:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743828451] [2024-06-20 20:04:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:04:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:04:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:04:04,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:04,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 265 transitions, 3610 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:04,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:04,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:04,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:06,328 INFO L124 PetriNetUnfolderBase]: 3693/5827 cut-off events. [2024-06-20 20:04:06,328 INFO L125 PetriNetUnfolderBase]: For 210252/210252 co-relation queries the response was YES. [2024-06-20 20:04:06,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47274 conditions, 5827 events. 3693/5827 cut-off events. For 210252/210252 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 34867 event pairs, 1041 based on Foata normal form. 4/5822 useless extension candidates. Maximal degree in co-relation 47195. Up to 5546 conditions per place. [2024-06-20 20:04:06,383 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 277 selfloop transitions, 23 changer transitions 0/305 dead transitions. [2024-06-20 20:04:06,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 305 transitions, 4460 flow [2024-06-20 20:04:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:04:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:04:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 20:04:06,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 20:04:06,385 INFO L175 Difference]: Start difference. First operand has 159 places, 265 transitions, 3610 flow. Second operand 9 states and 164 transitions. [2024-06-20 20:04:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 305 transitions, 4460 flow [2024-06-20 20:04:06,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 305 transitions, 4411 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 20:04:06,583 INFO L231 Difference]: Finished difference. Result has 165 places, 277 transitions, 3798 flow [2024-06-20 20:04:06,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3561, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3798, PETRI_PLACES=165, PETRI_TRANSITIONS=277} [2024-06-20 20:04:06,583 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places. [2024-06-20 20:04:06,583 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 277 transitions, 3798 flow [2024-06-20 20:04:06,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:06,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:06,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:06,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 20:04:06,584 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:06,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash -728447570, now seen corresponding path program 2 times [2024-06-20 20:04:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901090475] [2024-06-20 20:04:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:14,140 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-20 20:04:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901090475] [2024-06-20 20:04:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901090475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:04:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703924313] [2024-06-20 20:04:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:14,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:04:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:04:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:04:14,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:14,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 277 transitions, 3798 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:14,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:16,224 INFO L124 PetriNetUnfolderBase]: 3710/5866 cut-off events. [2024-06-20 20:04:16,224 INFO L125 PetriNetUnfolderBase]: For 218039/218039 co-relation queries the response was YES. [2024-06-20 20:04:16,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48058 conditions, 5866 events. 3710/5866 cut-off events. For 218039/218039 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35029 event pairs, 1009 based on Foata normal form. 4/5867 useless extension candidates. Maximal degree in co-relation 47975. Up to 5603 conditions per place. [2024-06-20 20:04:16,281 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 282 selfloop transitions, 20 changer transitions 0/307 dead transitions. [2024-06-20 20:04:16,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 307 transitions, 4562 flow [2024-06-20 20:04:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:04:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:04:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 20:04:16,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 20:04:16,283 INFO L175 Difference]: Start difference. First operand has 165 places, 277 transitions, 3798 flow. Second operand 8 states and 149 transitions. [2024-06-20 20:04:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 307 transitions, 4562 flow [2024-06-20 20:04:16,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 307 transitions, 4482 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-20 20:04:16,522 INFO L231 Difference]: Finished difference. Result has 172 places, 281 transitions, 3865 flow [2024-06-20 20:04:16,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3718, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3865, PETRI_PLACES=172, PETRI_TRANSITIONS=281} [2024-06-20 20:04:16,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-20 20:04:16,523 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 281 transitions, 3865 flow [2024-06-20 20:04:16,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:16,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:16,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:16,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 20:04:16,524 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:16,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1009377874, now seen corresponding path program 3 times [2024-06-20 20:04:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356350298] [2024-06-20 20:04:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:22,814 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-20 20:04:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:22,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356350298] [2024-06-20 20:04:22,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356350298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:22,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:22,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:04:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923386154] [2024-06-20 20:04:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:22,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:04:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:04:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:04:23,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:23,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 281 transitions, 3865 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:23,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:23,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:23,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:24,959 INFO L124 PetriNetUnfolderBase]: 3727/5898 cut-off events. [2024-06-20 20:04:24,959 INFO L125 PetriNetUnfolderBase]: For 226425/226425 co-relation queries the response was YES. [2024-06-20 20:04:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48626 conditions, 5898 events. 3727/5898 cut-off events. For 226425/226425 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35321 event pairs, 1025 based on Foata normal form. 4/5899 useless extension candidates. Maximal degree in co-relation 48540. Up to 5613 conditions per place. [2024-06-20 20:04:25,021 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 282 selfloop transitions, 24 changer transitions 0/311 dead transitions. [2024-06-20 20:04:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 311 transitions, 4626 flow [2024-06-20 20:04:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:04:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:04:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 20:04:25,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 20:04:25,023 INFO L175 Difference]: Start difference. First operand has 172 places, 281 transitions, 3865 flow. Second operand 8 states and 152 transitions. [2024-06-20 20:04:25,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 311 transitions, 4626 flow [2024-06-20 20:04:25,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 311 transitions, 4521 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-20 20:04:25,267 INFO L231 Difference]: Finished difference. Result has 176 places, 283 transitions, 3891 flow [2024-06-20 20:04:25,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3891, PETRI_PLACES=176, PETRI_TRANSITIONS=283} [2024-06-20 20:04:25,268 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-20 20:04:25,268 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 283 transitions, 3891 flow [2024-06-20 20:04:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:25,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:25,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 20:04:25,269 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:25,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2098272958, now seen corresponding path program 1 times [2024-06-20 20:04:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628133502] [2024-06-20 20:04:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:32,192 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-20 20:04:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628133502] [2024-06-20 20:04:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628133502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:04:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349230072] [2024-06-20 20:04:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:32,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:04:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:04:32,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:04:32,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:32,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 283 transitions, 3891 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:32,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:32,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:32,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:34,585 INFO L124 PetriNetUnfolderBase]: 3815/6033 cut-off events. [2024-06-20 20:04:34,585 INFO L125 PetriNetUnfolderBase]: For 245641/245643 co-relation queries the response was YES. [2024-06-20 20:04:34,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50380 conditions, 6033 events. 3815/6033 cut-off events. For 245641/245643 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 36255 event pairs, 988 based on Foata normal form. 5/6035 useless extension candidates. Maximal degree in co-relation 50293. Up to 5379 conditions per place. [2024-06-20 20:04:34,642 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 225 selfloop transitions, 105 changer transitions 0/335 dead transitions. [2024-06-20 20:04:34,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 335 transitions, 5345 flow [2024-06-20 20:04:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:04:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:04:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-20 20:04:34,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2024-06-20 20:04:34,644 INFO L175 Difference]: Start difference. First operand has 176 places, 283 transitions, 3891 flow. Second operand 9 states and 195 transitions. [2024-06-20 20:04:34,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 335 transitions, 5345 flow [2024-06-20 20:04:34,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 335 transitions, 5232 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-20 20:04:34,870 INFO L231 Difference]: Finished difference. Result has 181 places, 299 transitions, 4493 flow [2024-06-20 20:04:34,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3778, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4493, PETRI_PLACES=181, PETRI_TRANSITIONS=299} [2024-06-20 20:04:34,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-20 20:04:34,871 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 299 transitions, 4493 flow [2024-06-20 20:04:34,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:34,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:34,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 20:04:34,871 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:34,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash 855677778, now seen corresponding path program 2 times [2024-06-20 20:04:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735312740] [2024-06-20 20:04:34,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:43,518 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-20 20:04:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735312740] [2024-06-20 20:04:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735312740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:04:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941373709] [2024-06-20 20:04:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:43,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:04:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:04:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:04:43,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:43,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 299 transitions, 4493 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:43,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:43,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:43,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:45,844 INFO L124 PetriNetUnfolderBase]: 3830/6063 cut-off events. [2024-06-20 20:04:45,845 INFO L125 PetriNetUnfolderBase]: For 265001/265001 co-relation queries the response was YES. [2024-06-20 20:04:45,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52548 conditions, 6063 events. 3830/6063 cut-off events. For 265001/265001 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 36586 event pairs, 1015 based on Foata normal form. 6/6066 useless extension candidates. Maximal degree in co-relation 52458. Up to 5634 conditions per place. [2024-06-20 20:04:45,909 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 272 selfloop transitions, 66 changer transitions 0/343 dead transitions. [2024-06-20 20:04:45,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 343 transitions, 5569 flow [2024-06-20 20:04:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:04:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:04:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-20 20:04:45,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-06-20 20:04:45,910 INFO L175 Difference]: Start difference. First operand has 181 places, 299 transitions, 4493 flow. Second operand 9 states and 192 transitions. [2024-06-20 20:04:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 343 transitions, 5569 flow [2024-06-20 20:04:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 343 transitions, 5276 flow, removed 110 selfloop flow, removed 4 redundant places. [2024-06-20 20:04:46,274 INFO L231 Difference]: Finished difference. Result has 188 places, 308 transitions, 4603 flow [2024-06-20 20:04:46,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4236, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4603, PETRI_PLACES=188, PETRI_TRANSITIONS=308} [2024-06-20 20:04:46,275 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2024-06-20 20:04:46,275 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 308 transitions, 4603 flow [2024-06-20 20:04:46,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:46,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:46,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:46,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 20:04:46,275 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:46,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 996048302, now seen corresponding path program 4 times [2024-06-20 20:04:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050596395] [2024-06-20 20:04:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:04:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:04:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:04:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050596395] [2024-06-20 20:04:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050596395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:04:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:04:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:04:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033928909] [2024-06-20 20:04:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:04:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:04:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:04:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:04:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:04:53,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:04:53,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 308 transitions, 4603 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:53,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:04:53,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:04:53,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:04:55,925 INFO L124 PetriNetUnfolderBase]: 3847/6094 cut-off events. [2024-06-20 20:04:55,925 INFO L125 PetriNetUnfolderBase]: For 283514/283514 co-relation queries the response was YES. [2024-06-20 20:04:55,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53092 conditions, 6094 events. 3847/6094 cut-off events. For 283514/283514 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36765 event pairs, 1020 based on Foata normal form. 4/6091 useless extension candidates. Maximal degree in co-relation 52999. Up to 5776 conditions per place. [2024-06-20 20:04:55,983 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 305 selfloop transitions, 26 changer transitions 0/336 dead transitions. [2024-06-20 20:04:55,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 336 transitions, 5429 flow [2024-06-20 20:04:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:04:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:04:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 20:04:55,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 20:04:55,986 INFO L175 Difference]: Start difference. First operand has 188 places, 308 transitions, 4603 flow. Second operand 8 states and 149 transitions. [2024-06-20 20:04:55,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 336 transitions, 5429 flow [2024-06-20 20:04:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 336 transitions, 5173 flow, removed 88 selfloop flow, removed 4 redundant places. [2024-06-20 20:04:56,332 INFO L231 Difference]: Finished difference. Result has 193 places, 312 transitions, 4515 flow [2024-06-20 20:04:56,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4347, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4515, PETRI_PLACES=193, PETRI_TRANSITIONS=312} [2024-06-20 20:04:56,333 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-20 20:04:56,333 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 312 transitions, 4515 flow [2024-06-20 20:04:56,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:04:56,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:04:56,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:04:56,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 20:04:56,334 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:04:56,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:04:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash 649400590, now seen corresponding path program 3 times [2024-06-20 20:04:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:04:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784272519] [2024-06-20 20:04:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:04:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:04:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:04,457 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-20 20:05:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784272519] [2024-06-20 20:05:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784272519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:04,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:05:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772127337] [2024-06-20 20:05:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:04,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:05:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:04,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:05:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:05:04,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:04,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 312 transitions, 4515 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:04,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:04,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:06,885 INFO L124 PetriNetUnfolderBase]: 3908/6200 cut-off events. [2024-06-20 20:05:06,885 INFO L125 PetriNetUnfolderBase]: For 300326/300326 co-relation queries the response was YES. [2024-06-20 20:05:06,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54078 conditions, 6200 events. 3908/6200 cut-off events. For 300326/300326 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 37486 event pairs, 813 based on Foata normal form. 5/6202 useless extension candidates. Maximal degree in co-relation 53983. Up to 5043 conditions per place. [2024-06-20 20:05:06,958 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 241 selfloop transitions, 126 changer transitions 0/372 dead transitions. [2024-06-20 20:05:06,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 372 transitions, 6087 flow [2024-06-20 20:05:06,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:05:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:05:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-20 20:05:06,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195121951219512 [2024-06-20 20:05:06,961 INFO L175 Difference]: Start difference. First operand has 193 places, 312 transitions, 4515 flow. Second operand 10 states and 213 transitions. [2024-06-20 20:05:06,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 372 transitions, 6087 flow [2024-06-20 20:05:07,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 372 transitions, 5950 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-20 20:05:07,350 INFO L231 Difference]: Finished difference. Result has 199 places, 324 transitions, 4996 flow [2024-06-20 20:05:07,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4378, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4996, PETRI_PLACES=199, PETRI_TRANSITIONS=324} [2024-06-20 20:05:07,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-20 20:05:07,351 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 324 transitions, 4996 flow [2024-06-20 20:05:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:07,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:07,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 20:05:07,352 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:07,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1002719502, now seen corresponding path program 4 times [2024-06-20 20:05:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066190693] [2024-06-20 20:05:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:13,782 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-20 20:05:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066190693] [2024-06-20 20:05:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066190693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:05:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324679496] [2024-06-20 20:05:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:05:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:05:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:05:13,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:13,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 324 transitions, 4996 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:13,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:13,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:13,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:16,194 INFO L124 PetriNetUnfolderBase]: 4003/6341 cut-off events. [2024-06-20 20:05:16,194 INFO L125 PetriNetUnfolderBase]: For 332530/332530 co-relation queries the response was YES. [2024-06-20 20:05:16,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57791 conditions, 6341 events. 4003/6341 cut-off events. For 332530/332530 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38779 event pairs, 907 based on Foata normal form. 6/6332 useless extension candidates. Maximal degree in co-relation 57694. Up to 5183 conditions per place. [2024-06-20 20:05:16,268 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 237 selfloop transitions, 149 changer transitions 0/391 dead transitions. [2024-06-20 20:05:16,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 391 transitions, 6945 flow [2024-06-20 20:05:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:05:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:05:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-20 20:05:16,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2024-06-20 20:05:16,269 INFO L175 Difference]: Start difference. First operand has 199 places, 324 transitions, 4996 flow. Second operand 9 states and 194 transitions. [2024-06-20 20:05:16,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 391 transitions, 6945 flow [2024-06-20 20:05:16,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 391 transitions, 6698 flow, removed 76 selfloop flow, removed 4 redundant places. [2024-06-20 20:05:16,795 INFO L231 Difference]: Finished difference. Result has 207 places, 353 transitions, 5905 flow [2024-06-20 20:05:16,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4753, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5905, PETRI_PLACES=207, PETRI_TRANSITIONS=353} [2024-06-20 20:05:16,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-20 20:05:16,796 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 353 transitions, 5905 flow [2024-06-20 20:05:16,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:16,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:16,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:16,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 20:05:16,797 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:16,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -706158884, now seen corresponding path program 5 times [2024-06-20 20:05:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:16,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381069686] [2024-06-20 20:05:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:05:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381069686] [2024-06-20 20:05:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381069686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:05:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286737385] [2024-06-20 20:05:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:23,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:05:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:05:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:05:23,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:23,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 353 transitions, 5905 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:23,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:23,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:23,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:26,054 INFO L124 PetriNetUnfolderBase]: 4040/6399 cut-off events. [2024-06-20 20:05:26,054 INFO L125 PetriNetUnfolderBase]: For 353873/353873 co-relation queries the response was YES. [2024-06-20 20:05:26,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60874 conditions, 6399 events. 4040/6399 cut-off events. For 353873/353873 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 39147 event pairs, 871 based on Foata normal form. 6/6390 useless extension candidates. Maximal degree in co-relation 60772. Up to 5232 conditions per place. [2024-06-20 20:05:26,127 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 229 selfloop transitions, 170 changer transitions 0/404 dead transitions. [2024-06-20 20:05:26,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 404 transitions, 7581 flow [2024-06-20 20:05:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:05:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:05:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-20 20:05:26,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2024-06-20 20:05:26,130 INFO L175 Difference]: Start difference. First operand has 207 places, 353 transitions, 5905 flow. Second operand 9 states and 194 transitions. [2024-06-20 20:05:26,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 404 transitions, 7581 flow [2024-06-20 20:05:26,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 404 transitions, 7214 flow, removed 168 selfloop flow, removed 2 redundant places. [2024-06-20 20:05:26,642 INFO L231 Difference]: Finished difference. Result has 215 places, 369 transitions, 6422 flow [2024-06-20 20:05:26,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5566, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6422, PETRI_PLACES=215, PETRI_TRANSITIONS=369} [2024-06-20 20:05:26,643 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-20 20:05:26,643 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 369 transitions, 6422 flow [2024-06-20 20:05:26,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:26,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:26,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:26,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 20:05:26,644 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:26,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash -697496658, now seen corresponding path program 5 times [2024-06-20 20:05:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628871316] [2024-06-20 20:05:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:33,840 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-20 20:05:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628871316] [2024-06-20 20:05:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628871316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:33,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:33,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:05:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288155019] [2024-06-20 20:05:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:33,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:05:33,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:05:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:05:34,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:34,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 369 transitions, 6422 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:34,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:34,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:34,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:36,227 INFO L124 PetriNetUnfolderBase]: 4116/6543 cut-off events. [2024-06-20 20:05:36,228 INFO L125 PetriNetUnfolderBase]: For 369072/369072 co-relation queries the response was YES. [2024-06-20 20:05:36,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62850 conditions, 6543 events. 4116/6543 cut-off events. For 369072/369072 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 40142 event pairs, 1038 based on Foata normal form. 4/6544 useless extension candidates. Maximal degree in co-relation 62745. Up to 6133 conditions per place. [2024-06-20 20:05:36,301 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 378 selfloop transitions, 35 changer transitions 0/418 dead transitions. [2024-06-20 20:05:36,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 418 transitions, 7559 flow [2024-06-20 20:05:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:05:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:05:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-20 20:05:36,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 20:05:36,304 INFO L175 Difference]: Start difference. First operand has 215 places, 369 transitions, 6422 flow. Second operand 9 states and 171 transitions. [2024-06-20 20:05:36,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 418 transitions, 7559 flow [2024-06-20 20:05:36,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 418 transitions, 7256 flow, removed 134 selfloop flow, removed 2 redundant places. [2024-06-20 20:05:36,936 INFO L231 Difference]: Finished difference. Result has 224 places, 385 transitions, 6459 flow [2024-06-20 20:05:36,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6129, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6459, PETRI_PLACES=224, PETRI_TRANSITIONS=385} [2024-06-20 20:05:36,937 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-20 20:05:36,937 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 385 transitions, 6459 flow [2024-06-20 20:05:36,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:36,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:36,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:36,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 20:05:36,938 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:36,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 490241488, now seen corresponding path program 6 times [2024-06-20 20:05:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787115791] [2024-06-20 20:05:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:43,962 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-20 20:05:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787115791] [2024-06-20 20:05:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787115791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:43,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:05:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596026116] [2024-06-20 20:05:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:43,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:05:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:05:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:05:44,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:44,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 385 transitions, 6459 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:44,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:44,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:46,437 INFO L124 PetriNetUnfolderBase]: 4216/6711 cut-off events. [2024-06-20 20:05:46,437 INFO L125 PetriNetUnfolderBase]: For 382306/382306 co-relation queries the response was YES. [2024-06-20 20:05:46,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64041 conditions, 6711 events. 4216/6711 cut-off events. For 382306/382306 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 41365 event pairs, 1086 based on Foata normal form. 4/6712 useless extension candidates. Maximal degree in co-relation 63932. Up to 6278 conditions per place. [2024-06-20 20:05:46,515 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 396 selfloop transitions, 39 changer transitions 0/440 dead transitions. [2024-06-20 20:05:46,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 440 transitions, 7873 flow [2024-06-20 20:05:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:05:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:05:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-20 20:05:46,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-20 20:05:46,517 INFO L175 Difference]: Start difference. First operand has 224 places, 385 transitions, 6459 flow. Second operand 9 states and 169 transitions. [2024-06-20 20:05:46,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 440 transitions, 7873 flow [2024-06-20 20:05:47,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 440 transitions, 7623 flow, removed 81 selfloop flow, removed 6 redundant places. [2024-06-20 20:05:47,034 INFO L231 Difference]: Finished difference. Result has 230 places, 408 transitions, 6813 flow [2024-06-20 20:05:47,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6309, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6813, PETRI_PLACES=230, PETRI_TRANSITIONS=408} [2024-06-20 20:05:47,035 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places. [2024-06-20 20:05:47,035 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 408 transitions, 6813 flow [2024-06-20 20:05:47,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:47,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:47,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:47,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 20:05:47,035 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:47,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash -694483146, now seen corresponding path program 7 times [2024-06-20 20:05:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:47,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286627687] [2024-06-20 20:05:47,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:05:53,996 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-20 20:05:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:05:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286627687] [2024-06-20 20:05:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286627687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:05:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:05:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:05:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724488809] [2024-06-20 20:05:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:05:53,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:05:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:05:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:05:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:05:54,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:05:54,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 408 transitions, 6813 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:54,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:05:54,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:05:54,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:05:56,506 INFO L124 PetriNetUnfolderBase]: 4274/6809 cut-off events. [2024-06-20 20:05:56,507 INFO L125 PetriNetUnfolderBase]: For 391830/391830 co-relation queries the response was YES. [2024-06-20 20:05:56,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64719 conditions, 6809 events. 4274/6809 cut-off events. For 391830/391830 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 41960 event pairs, 1011 based on Foata normal form. 4/6810 useless extension candidates. Maximal degree in co-relation 64606. Up to 6234 conditions per place. [2024-06-20 20:05:56,586 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 386 selfloop transitions, 65 changer transitions 0/456 dead transitions. [2024-06-20 20:05:56,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 456 transitions, 8108 flow [2024-06-20 20:05:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:05:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:05:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-20 20:05:56,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-20 20:05:56,588 INFO L175 Difference]: Start difference. First operand has 230 places, 408 transitions, 6813 flow. Second operand 9 states and 170 transitions. [2024-06-20 20:05:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 456 transitions, 8108 flow [2024-06-20 20:05:57,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 456 transitions, 7903 flow, removed 77 selfloop flow, removed 5 redundant places. [2024-06-20 20:05:57,236 INFO L231 Difference]: Finished difference. Result has 235 places, 423 transitions, 7080 flow [2024-06-20 20:05:57,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6685, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7080, PETRI_PLACES=235, PETRI_TRANSITIONS=423} [2024-06-20 20:05:57,236 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-20 20:05:57,236 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 423 transitions, 7080 flow [2024-06-20 20:05:57,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:05:57,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:05:57,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:05:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 20:05:57,237 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:05:57,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:05:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1502644516, now seen corresponding path program 1 times [2024-06-20 20:05:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:05:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663174878] [2024-06-20 20:05:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:05:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:05:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:06:05,552 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-20 20:06:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:06:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663174878] [2024-06-20 20:06:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663174878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:06:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:06:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:06:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637246301] [2024-06-20 20:06:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:06:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:06:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:06:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:06:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:06:05,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:06:05,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 423 transitions, 7080 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:05,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:06:05,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:06:05,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:06:07,840 INFO L124 PetriNetUnfolderBase]: 4366/6952 cut-off events. [2024-06-20 20:06:07,840 INFO L125 PetriNetUnfolderBase]: For 416248/416248 co-relation queries the response was YES. [2024-06-20 20:06:07,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66677 conditions, 6952 events. 4366/6952 cut-off events. For 416248/416248 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 43094 event pairs, 1000 based on Foata normal form. 12/6956 useless extension candidates. Maximal degree in co-relation 66563. Up to 5953 conditions per place. [2024-06-20 20:06:07,919 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 372 selfloop transitions, 88 changer transitions 0/465 dead transitions. [2024-06-20 20:06:07,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 465 transitions, 8763 flow [2024-06-20 20:06:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:06:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:06:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-20 20:06:07,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2024-06-20 20:06:07,920 INFO L175 Difference]: Start difference. First operand has 235 places, 423 transitions, 7080 flow. Second operand 7 states and 142 transitions. [2024-06-20 20:06:07,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 465 transitions, 8763 flow [2024-06-20 20:06:08,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 465 transitions, 8564 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-20 20:06:08,515 INFO L231 Difference]: Finished difference. Result has 236 places, 440 transitions, 7502 flow [2024-06-20 20:06:08,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6881, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7502, PETRI_PLACES=236, PETRI_TRANSITIONS=440} [2024-06-20 20:06:08,516 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places. [2024-06-20 20:06:08,516 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 440 transitions, 7502 flow [2024-06-20 20:06:08,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:08,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:06:08,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:06:08,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 20:06:08,517 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:06:08,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:06:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1102601524, now seen corresponding path program 2 times [2024-06-20 20:06:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:06:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880850301] [2024-06-20 20:06:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:06:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:06:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:06:16,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-20 20:06:16,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:06:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880850301] [2024-06-20 20:06:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880850301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:06:16,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:06:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:06:16,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434249752] [2024-06-20 20:06:16,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:06:16,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:06:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:06:16,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:06:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:06:16,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:06:16,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 440 transitions, 7502 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:16,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:06:16,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:06:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:06:19,045 INFO L124 PetriNetUnfolderBase]: 4404/6998 cut-off events. [2024-06-20 20:06:19,045 INFO L125 PetriNetUnfolderBase]: For 425717/425717 co-relation queries the response was YES. [2024-06-20 20:06:19,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67883 conditions, 6998 events. 4404/6998 cut-off events. For 425717/425717 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 43398 event pairs, 1164 based on Foata normal form. 6/6994 useless extension candidates. Maximal degree in co-relation 67768. Up to 6497 conditions per place. [2024-06-20 20:06:19,124 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 408 selfloop transitions, 48 changer transitions 0/461 dead transitions. [2024-06-20 20:06:19,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 461 transitions, 8756 flow [2024-06-20 20:06:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:06:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:06:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 20:06:19,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 20:06:19,125 INFO L175 Difference]: Start difference. First operand has 236 places, 440 transitions, 7502 flow. Second operand 7 states and 130 transitions. [2024-06-20 20:06:19,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 461 transitions, 8756 flow [2024-06-20 20:06:19,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 461 transitions, 8627 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-20 20:06:19,731 INFO L231 Difference]: Finished difference. Result has 240 places, 446 transitions, 7634 flow [2024-06-20 20:06:19,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7376, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7634, PETRI_PLACES=240, PETRI_TRANSITIONS=446} [2024-06-20 20:06:19,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-20 20:06:19,732 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 446 transitions, 7634 flow [2024-06-20 20:06:19,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:19,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:06:19,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:06:19,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 20:06:19,732 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:06:19,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:06:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1063283914, now seen corresponding path program 3 times [2024-06-20 20:06:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:06:19,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315899708] [2024-06-20 20:06:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:06:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:06:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:06:27,389 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-20 20:06:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:06:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315899708] [2024-06-20 20:06:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315899708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:06:27,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:06:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:06:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277422934] [2024-06-20 20:06:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:06:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:06:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:06:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:06:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:06:27,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:06:27,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 446 transitions, 7634 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:27,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:06:27,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:06:27,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:06:29,806 INFO L124 PetriNetUnfolderBase]: 4386/6968 cut-off events. [2024-06-20 20:06:29,806 INFO L125 PetriNetUnfolderBase]: For 432159/432159 co-relation queries the response was YES. [2024-06-20 20:06:29,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67296 conditions, 6968 events. 4386/6968 cut-off events. For 432159/432159 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 43121 event pairs, 1163 based on Foata normal form. 6/6964 useless extension candidates. Maximal degree in co-relation 67180. Up to 6593 conditions per place. [2024-06-20 20:06:29,884 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 420 selfloop transitions, 32 changer transitions 0/457 dead transitions. [2024-06-20 20:06:29,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 457 transitions, 8593 flow [2024-06-20 20:06:29,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:06:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:06:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 20:06:29,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 20:06:29,886 INFO L175 Difference]: Start difference. First operand has 240 places, 446 transitions, 7634 flow. Second operand 7 states and 126 transitions. [2024-06-20 20:06:29,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 457 transitions, 8593 flow [2024-06-20 20:06:30,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 457 transitions, 8253 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-20 20:06:30,426 INFO L231 Difference]: Finished difference. Result has 240 places, 446 transitions, 7367 flow [2024-06-20 20:06:30,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7294, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7367, PETRI_PLACES=240, PETRI_TRANSITIONS=446} [2024-06-20 20:06:30,427 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-20 20:06:30,427 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 446 transitions, 7367 flow [2024-06-20 20:06:30,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:30,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:06:30,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:06:30,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 20:06:30,427 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:06:30,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:06:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1680022114, now seen corresponding path program 1 times [2024-06-20 20:06:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:06:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095076036] [2024-06-20 20:06:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:06:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:06:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:06:40,583 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-20 20:06:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:06:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095076036] [2024-06-20 20:06:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095076036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:06:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:06:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:06:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909936524] [2024-06-20 20:06:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:06:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:06:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:06:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:06:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:06:40,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:06:40,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 446 transitions, 7367 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:40,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:06:40,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:06:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:06:43,215 INFO L124 PetriNetUnfolderBase]: 4425/7032 cut-off events. [2024-06-20 20:06:43,215 INFO L125 PetriNetUnfolderBase]: For 444583/444583 co-relation queries the response was YES. [2024-06-20 20:06:43,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67361 conditions, 7032 events. 4425/7032 cut-off events. For 444583/444583 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 43604 event pairs, 1182 based on Foata normal form. 14/7027 useless extension candidates. Maximal degree in co-relation 67245. Up to 6527 conditions per place. [2024-06-20 20:06:43,289 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 400 selfloop transitions, 58 changer transitions 0/463 dead transitions. [2024-06-20 20:06:43,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 463 transitions, 8445 flow [2024-06-20 20:06:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:06:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:06:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-20 20:06:43,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 20:06:43,290 INFO L175 Difference]: Start difference. First operand has 240 places, 446 transitions, 7367 flow. Second operand 7 states and 133 transitions. [2024-06-20 20:06:43,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 463 transitions, 8445 flow [2024-06-20 20:06:43,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 463 transitions, 8232 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-20 20:06:43,884 INFO L231 Difference]: Finished difference. Result has 238 places, 448 transitions, 7320 flow [2024-06-20 20:06:43,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7154, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7320, PETRI_PLACES=238, PETRI_TRANSITIONS=448} [2024-06-20 20:06:43,884 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 196 predicate places. [2024-06-20 20:06:43,884 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 448 transitions, 7320 flow [2024-06-20 20:06:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:43,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:06:43,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:06:43,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 20:06:43,885 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:06:43,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:06:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1996746341, now seen corresponding path program 1 times [2024-06-20 20:06:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:06:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484378277] [2024-06-20 20:06:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:06:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:06:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:06:51,193 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-20 20:06:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:06:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484378277] [2024-06-20 20:06:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484378277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:06:51,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:06:51,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:06:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779676770] [2024-06-20 20:06:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:06:51,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:06:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:06:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:06:51,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:06:51,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:06:51,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 448 transitions, 7320 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:51,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:06:51,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:06:51,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:06:53,869 INFO L124 PetriNetUnfolderBase]: 4576/7268 cut-off events. [2024-06-20 20:06:53,869 INFO L125 PetriNetUnfolderBase]: For 475867/475867 co-relation queries the response was YES. [2024-06-20 20:06:53,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69981 conditions, 7268 events. 4576/7268 cut-off events. For 475867/475867 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 45307 event pairs, 1107 based on Foata normal form. 14/7279 useless extension candidates. Maximal degree in co-relation 69868. Up to 6190 conditions per place. [2024-06-20 20:06:53,959 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 418 selfloop transitions, 75 changer transitions 0/498 dead transitions. [2024-06-20 20:06:53,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 498 transitions, 8960 flow [2024-06-20 20:06:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:06:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:06:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-20 20:06:53,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149051490514905 [2024-06-20 20:06:53,960 INFO L175 Difference]: Start difference. First operand has 238 places, 448 transitions, 7320 flow. Second operand 9 states and 190 transitions. [2024-06-20 20:06:53,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 498 transitions, 8960 flow [2024-06-20 20:06:54,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 498 transitions, 8818 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-20 20:06:54,852 INFO L231 Difference]: Finished difference. Result has 244 places, 457 transitions, 7663 flow [2024-06-20 20:06:54,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7180, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7663, PETRI_PLACES=244, PETRI_TRANSITIONS=457} [2024-06-20 20:06:54,853 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-20 20:06:54,853 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 457 transitions, 7663 flow [2024-06-20 20:06:54,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:06:54,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:06:54,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:06:54,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 20:06:54,853 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:06:54,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:06:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1366465873, now seen corresponding path program 2 times [2024-06-20 20:06:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:06:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002073157] [2024-06-20 20:06:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:06:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:06:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:07:02,095 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-20 20:07:02,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:07:02,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002073157] [2024-06-20 20:07:02,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002073157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:07:02,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:07:02,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:07:02,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639688518] [2024-06-20 20:07:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:07:02,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:07:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:07:02,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:07:02,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:07:02,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:07:02,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 457 transitions, 7663 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:02,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:07:02,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:07:02,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:07:04,913 INFO L124 PetriNetUnfolderBase]: 4685/7460 cut-off events. [2024-06-20 20:07:04,913 INFO L125 PetriNetUnfolderBase]: For 510144/510144 co-relation queries the response was YES. [2024-06-20 20:07:04,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72924 conditions, 7460 events. 4685/7460 cut-off events. For 510144/510144 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 46852 event pairs, 1164 based on Foata normal form. 16/7473 useless extension candidates. Maximal degree in co-relation 72808. Up to 6831 conditions per place. [2024-06-20 20:07:04,999 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 444 selfloop transitions, 56 changer transitions 0/505 dead transitions. [2024-06-20 20:07:05,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 505 transitions, 9317 flow [2024-06-20 20:07:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:07:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:07:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-20 20:07:05,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 20:07:05,001 INFO L175 Difference]: Start difference. First operand has 244 places, 457 transitions, 7663 flow. Second operand 9 states and 189 transitions. [2024-06-20 20:07:05,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 505 transitions, 9317 flow [2024-06-20 20:07:05,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 505 transitions, 9145 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-20 20:07:05,816 INFO L231 Difference]: Finished difference. Result has 251 places, 467 transitions, 7879 flow [2024-06-20 20:07:05,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7491, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7879, PETRI_PLACES=251, PETRI_TRANSITIONS=467} [2024-06-20 20:07:05,817 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-20 20:07:05,817 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 467 transitions, 7879 flow [2024-06-20 20:07:05,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:05,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:07:05,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:07:05,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 20:07:05,817 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:07:05,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:07:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash -828758165, now seen corresponding path program 3 times [2024-06-20 20:07:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:07:05,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276602485] [2024-06-20 20:07:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:07:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:07:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:07:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 20:07:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:07:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276602485] [2024-06-20 20:07:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276602485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:07:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:07:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:07:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993482149] [2024-06-20 20:07:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:07:13,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:07:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:07:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:07:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:07:13,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:07:13,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 467 transitions, 7879 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:13,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:07:13,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:07:13,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:07:16,307 INFO L124 PetriNetUnfolderBase]: 4906/7788 cut-off events. [2024-06-20 20:07:16,307 INFO L125 PetriNetUnfolderBase]: For 559809/559809 co-relation queries the response was YES. [2024-06-20 20:07:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77718 conditions, 7788 events. 4906/7788 cut-off events. For 559809/559809 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49209 event pairs, 1166 based on Foata normal form. 16/7801 useless extension candidates. Maximal degree in co-relation 77598. Up to 6828 conditions per place. [2024-06-20 20:07:16,400 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 455 selfloop transitions, 58 changer transitions 0/518 dead transitions. [2024-06-20 20:07:16,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 518 transitions, 9838 flow [2024-06-20 20:07:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:07:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:07:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-20 20:07:16,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2024-06-20 20:07:16,401 INFO L175 Difference]: Start difference. First operand has 251 places, 467 transitions, 7879 flow. Second operand 9 states and 194 transitions. [2024-06-20 20:07:16,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 518 transitions, 9838 flow [2024-06-20 20:07:17,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 518 transitions, 9688 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-20 20:07:17,458 INFO L231 Difference]: Finished difference. Result has 257 places, 473 transitions, 8089 flow [2024-06-20 20:07:17,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7729, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8089, PETRI_PLACES=257, PETRI_TRANSITIONS=473} [2024-06-20 20:07:17,458 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-20 20:07:17,458 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 473 transitions, 8089 flow [2024-06-20 20:07:17,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:17,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:07:17,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:07:17,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 20:07:17,459 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:07:17,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:07:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1646889169, now seen corresponding path program 4 times [2024-06-20 20:07:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:07:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092699328] [2024-06-20 20:07:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:07:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:07:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:07:24,419 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-20 20:07:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:07:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092699328] [2024-06-20 20:07:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092699328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:07:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:07:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:07:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085058723] [2024-06-20 20:07:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:07:24,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:07:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:07:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:07:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:07:24,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:07:24,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 473 transitions, 8089 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:24,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:07:24,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:07:24,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:07:27,346 INFO L124 PetriNetUnfolderBase]: 4886/7759 cut-off events. [2024-06-20 20:07:27,347 INFO L125 PetriNetUnfolderBase]: For 569253/569253 co-relation queries the response was YES. [2024-06-20 20:07:27,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77699 conditions, 7759 events. 4886/7759 cut-off events. For 569253/569253 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 48954 event pairs, 1177 based on Foata normal form. 16/7772 useless extension candidates. Maximal degree in co-relation 77577. Up to 7146 conditions per place. [2024-06-20 20:07:27,432 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 449 selfloop transitions, 59 changer transitions 0/513 dead transitions. [2024-06-20 20:07:27,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 513 transitions, 9544 flow [2024-06-20 20:07:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:07:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:07:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-20 20:07:27,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 20:07:27,433 INFO L175 Difference]: Start difference. First operand has 257 places, 473 transitions, 8089 flow. Second operand 9 states and 189 transitions. [2024-06-20 20:07:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 513 transitions, 9544 flow [2024-06-20 20:07:28,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 513 transitions, 9378 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-06-20 20:07:28,204 INFO L231 Difference]: Finished difference. Result has 261 places, 476 transitions, 8169 flow [2024-06-20 20:07:28,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7931, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8169, PETRI_PLACES=261, PETRI_TRANSITIONS=476} [2024-06-20 20:07:28,204 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places. [2024-06-20 20:07:28,204 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 476 transitions, 8169 flow [2024-06-20 20:07:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:28,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:07:28,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:07:28,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 20:07:28,205 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:07:28,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:07:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1965243661, now seen corresponding path program 5 times [2024-06-20 20:07:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:07:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432371935] [2024-06-20 20:07:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:07:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:07:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:07:36,112 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-20 20:07:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:07:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432371935] [2024-06-20 20:07:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432371935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:07:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:07:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:07:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241699592] [2024-06-20 20:07:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:07:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:07:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:07:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:07:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:07:36,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:07:36,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 476 transitions, 8169 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:36,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:07:36,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:07:36,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:07:39,156 INFO L124 PetriNetUnfolderBase]: 5132/8146 cut-off events. [2024-06-20 20:07:39,156 INFO L125 PetriNetUnfolderBase]: For 623514/623514 co-relation queries the response was YES. [2024-06-20 20:07:39,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82672 conditions, 8146 events. 5132/8146 cut-off events. For 623514/623514 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 51794 event pairs, 1294 based on Foata normal form. 16/8159 useless extension candidates. Maximal degree in co-relation 82548. Up to 7300 conditions per place. [2024-06-20 20:07:39,250 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 460 selfloop transitions, 62 changer transitions 0/527 dead transitions. [2024-06-20 20:07:39,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 527 transitions, 10081 flow [2024-06-20 20:07:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:07:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:07:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-20 20:07:39,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2024-06-20 20:07:39,251 INFO L175 Difference]: Start difference. First operand has 261 places, 476 transitions, 8169 flow. Second operand 9 states and 195 transitions. [2024-06-20 20:07:39,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 527 transitions, 10081 flow [2024-06-20 20:07:40,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 527 transitions, 9890 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-20 20:07:40,302 INFO L231 Difference]: Finished difference. Result has 264 places, 482 transitions, 8353 flow [2024-06-20 20:07:40,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7978, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8353, PETRI_PLACES=264, PETRI_TRANSITIONS=482} [2024-06-20 20:07:40,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-20 20:07:40,303 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 482 transitions, 8353 flow [2024-06-20 20:07:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:40,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:07:40,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:07:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 20:07:40,303 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:07:40,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:07:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1225793859, now seen corresponding path program 6 times [2024-06-20 20:07:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:07:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456349671] [2024-06-20 20:07:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:07:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:07:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:07:48,222 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-20 20:07:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:07:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456349671] [2024-06-20 20:07:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456349671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:07:48,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:07:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:07:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148759827] [2024-06-20 20:07:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:07:48,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:07:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:07:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:07:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:07:48,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:07:48,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 482 transitions, 8353 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:48,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:07:48,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:07:48,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:07:51,174 INFO L124 PetriNetUnfolderBase]: 5125/8141 cut-off events. [2024-06-20 20:07:51,174 INFO L125 PetriNetUnfolderBase]: For 631923/631923 co-relation queries the response was YES. [2024-06-20 20:07:51,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82756 conditions, 8141 events. 5125/8141 cut-off events. For 631923/631923 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 51972 event pairs, 1339 based on Foata normal form. 16/8154 useless extension candidates. Maximal degree in co-relation 82631. Up to 7539 conditions per place. [2024-06-20 20:07:51,274 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 457 selfloop transitions, 61 changer transitions 0/523 dead transitions. [2024-06-20 20:07:51,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 523 transitions, 9851 flow [2024-06-20 20:07:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:07:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:07:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-20 20:07:51,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149051490514905 [2024-06-20 20:07:51,275 INFO L175 Difference]: Start difference. First operand has 264 places, 482 transitions, 8353 flow. Second operand 9 states and 190 transitions. [2024-06-20 20:07:51,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 523 transitions, 9851 flow [2024-06-20 20:07:52,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 523 transitions, 9671 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-20 20:07:52,225 INFO L231 Difference]: Finished difference. Result has 269 places, 485 transitions, 8448 flow [2024-06-20 20:07:52,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8185, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8448, PETRI_PLACES=269, PETRI_TRANSITIONS=485} [2024-06-20 20:07:52,226 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places. [2024-06-20 20:07:52,226 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 485 transitions, 8448 flow [2024-06-20 20:07:52,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:07:52,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:07:52,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:07:52,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 20:07:52,227 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:07:52,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:07:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -899962725, now seen corresponding path program 1 times [2024-06-20 20:07:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:07:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834289816] [2024-06-20 20:07:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:07:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:07:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:08:00,396 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-20 20:08:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:08:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834289816] [2024-06-20 20:08:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834289816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:08:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:08:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:08:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311243351] [2024-06-20 20:08:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:08:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:08:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:08:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:08:00,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:08:00,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:08:00,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 485 transitions, 8448 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:00,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:08:00,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:08:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:08:04,190 INFO L124 PetriNetUnfolderBase]: 5861/9385 cut-off events. [2024-06-20 20:08:04,190 INFO L125 PetriNetUnfolderBase]: For 889536/889536 co-relation queries the response was YES. [2024-06-20 20:08:04,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97498 conditions, 9385 events. 5861/9385 cut-off events. For 889536/889536 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 61825 event pairs, 1358 based on Foata normal form. 54/9436 useless extension candidates. Maximal degree in co-relation 97371. Up to 6976 conditions per place. [2024-06-20 20:08:04,305 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 456 selfloop transitions, 83 changer transitions 0/544 dead transitions. [2024-06-20 20:08:04,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 544 transitions, 10493 flow [2024-06-20 20:08:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:08:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:08:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2024-06-20 20:08:04,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5341463414634147 [2024-06-20 20:08:04,307 INFO L175 Difference]: Start difference. First operand has 269 places, 485 transitions, 8448 flow. Second operand 10 states and 219 transitions. [2024-06-20 20:08:04,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 544 transitions, 10493 flow [2024-06-20 20:08:05,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 544 transitions, 10300 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-20 20:08:05,483 INFO L231 Difference]: Finished difference. Result has 273 places, 491 transitions, 8740 flow [2024-06-20 20:08:05,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8255, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8740, PETRI_PLACES=273, PETRI_TRANSITIONS=491} [2024-06-20 20:08:05,484 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-20 20:08:05,484 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 491 transitions, 8740 flow [2024-06-20 20:08:05,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:05,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:08:05,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:08:05,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 20:08:05,484 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:08:05,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:08:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1639531567, now seen corresponding path program 2 times [2024-06-20 20:08:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:08:05,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101108804] [2024-06-20 20:08:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:08:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:08:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:08:15,422 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-20 20:08:15,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:08:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101108804] [2024-06-20 20:08:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101108804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:08:15,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:08:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:08:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454156082] [2024-06-20 20:08:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:08:15,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:08:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:08:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:08:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:08:15,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:08:15,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 491 transitions, 8740 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:15,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:08:15,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:08:15,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:08:19,104 INFO L124 PetriNetUnfolderBase]: 5872/9405 cut-off events. [2024-06-20 20:08:19,104 INFO L125 PetriNetUnfolderBase]: For 870792/870792 co-relation queries the response was YES. [2024-06-20 20:08:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96671 conditions, 9405 events. 5872/9405 cut-off events. For 870792/870792 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 62102 event pairs, 1606 based on Foata normal form. 58/9460 useless extension candidates. Maximal degree in co-relation 96542. Up to 8290 conditions per place. [2024-06-20 20:08:19,216 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 460 selfloop transitions, 76 changer transitions 0/541 dead transitions. [2024-06-20 20:08:19,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 541 transitions, 10275 flow [2024-06-20 20:08:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 20:08:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 20:08:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-06-20 20:08:19,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-06-20 20:08:19,217 INFO L175 Difference]: Start difference. First operand has 273 places, 491 transitions, 8740 flow. Second operand 11 states and 232 transitions. [2024-06-20 20:08:19,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 541 transitions, 10275 flow [2024-06-20 20:08:20,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 541 transitions, 10099 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-20 20:08:20,209 INFO L231 Difference]: Finished difference. Result has 279 places, 492 transitions, 8781 flow [2024-06-20 20:08:20,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8566, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8781, PETRI_PLACES=279, PETRI_TRANSITIONS=492} [2024-06-20 20:08:20,209 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 237 predicate places. [2024-06-20 20:08:20,209 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 492 transitions, 8781 flow [2024-06-20 20:08:20,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:20,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:08:20,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:08:20,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 20:08:20,210 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:08:20,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:08:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1846185007, now seen corresponding path program 3 times [2024-06-20 20:08:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:08:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144277646] [2024-06-20 20:08:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:08:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:08:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:08:27,291 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-20 20:08:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:08:27,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144277646] [2024-06-20 20:08:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144277646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:08:27,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:08:27,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:08:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743408317] [2024-06-20 20:08:27,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:08:27,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:08:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:08:27,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:08:27,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:08:27,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:08:27,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 492 transitions, 8781 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:27,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:08:27,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:08:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:08:31,040 INFO L124 PetriNetUnfolderBase]: 6139/9854 cut-off events. [2024-06-20 20:08:31,040 INFO L125 PetriNetUnfolderBase]: For 912828/912828 co-relation queries the response was YES. [2024-06-20 20:08:31,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100746 conditions, 9854 events. 6139/9854 cut-off events. For 912828/912828 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 65823 event pairs, 1735 based on Foata normal form. 58/9909 useless extension candidates. Maximal degree in co-relation 100615. Up to 8883 conditions per place. [2024-06-20 20:08:31,163 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 479 selfloop transitions, 60 changer transitions 0/544 dead transitions. [2024-06-20 20:08:31,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 544 transitions, 10554 flow [2024-06-20 20:08:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:08:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:08:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-06-20 20:08:31,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 20:08:31,164 INFO L175 Difference]: Start difference. First operand has 279 places, 492 transitions, 8781 flow. Second operand 10 states and 210 transitions. [2024-06-20 20:08:31,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 544 transitions, 10554 flow [2024-06-20 20:08:32,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 544 transitions, 10314 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-20 20:08:32,551 INFO L231 Difference]: Finished difference. Result has 281 places, 499 transitions, 8883 flow [2024-06-20 20:08:32,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8556, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8883, PETRI_PLACES=281, PETRI_TRANSITIONS=499} [2024-06-20 20:08:32,552 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 239 predicate places. [2024-06-20 20:08:32,552 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 499 transitions, 8883 flow [2024-06-20 20:08:32,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:32,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:08:32,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:08:32,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 20:08:32,553 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:08:32,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:08:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1646883217, now seen corresponding path program 4 times [2024-06-20 20:08:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:08:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422490266] [2024-06-20 20:08:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:08:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:08:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:08:40,995 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-20 20:08:40,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:08:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422490266] [2024-06-20 20:08:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422490266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:08:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:08:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:08:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135674057] [2024-06-20 20:08:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:08:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:08:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:08:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:08:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:08:41,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:08:41,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 499 transitions, 8883 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:41,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:08:41,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:08:41,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:08:44,696 INFO L124 PetriNetUnfolderBase]: 6310/10162 cut-off events. [2024-06-20 20:08:44,697 INFO L125 PetriNetUnfolderBase]: For 921036/921036 co-relation queries the response was YES. [2024-06-20 20:08:44,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102316 conditions, 10162 events. 6310/10162 cut-off events. For 921036/921036 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 68500 event pairs, 1797 based on Foata normal form. 58/10217 useless extension candidates. Maximal degree in co-relation 102183. Up to 9188 conditions per place. [2024-06-20 20:08:44,833 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 477 selfloop transitions, 63 changer transitions 0/545 dead transitions. [2024-06-20 20:08:44,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 545 transitions, 10458 flow [2024-06-20 20:08:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:08:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:08:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-06-20 20:08:44,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 20:08:44,834 INFO L175 Difference]: Start difference. First operand has 281 places, 499 transitions, 8883 flow. Second operand 10 states and 210 transitions. [2024-06-20 20:08:44,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 545 transitions, 10458 flow [2024-06-20 20:08:46,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 545 transitions, 10301 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-20 20:08:46,487 INFO L231 Difference]: Finished difference. Result has 285 places, 501 transitions, 8970 flow [2024-06-20 20:08:46,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8726, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8970, PETRI_PLACES=285, PETRI_TRANSITIONS=501} [2024-06-20 20:08:46,488 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-20 20:08:46,488 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 501 transitions, 8970 flow [2024-06-20 20:08:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:46,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:08:46,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:08:46,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 20:08:46,488 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:08:46,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:08:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1965089839, now seen corresponding path program 5 times [2024-06-20 20:08:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:08:46,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051474823] [2024-06-20 20:08:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:08:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:08:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:08:54,099 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-20 20:08:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:08:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051474823] [2024-06-20 20:08:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051474823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:08:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:08:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:08:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092094956] [2024-06-20 20:08:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:08:54,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:08:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:08:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:08:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:08:54,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:08:54,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 501 transitions, 8970 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:54,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:08:54,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:08:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:08:57,872 INFO L124 PetriNetUnfolderBase]: 6572/10610 cut-off events. [2024-06-20 20:08:57,872 INFO L125 PetriNetUnfolderBase]: For 959347/959347 co-relation queries the response was YES. [2024-06-20 20:08:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106248 conditions, 10610 events. 6572/10610 cut-off events. For 959347/959347 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 72316 event pairs, 2076 based on Foata normal form. 58/10665 useless extension candidates. Maximal degree in co-relation 106114. Up to 9633 conditions per place. [2024-06-20 20:08:58,019 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 482 selfloop transitions, 74 changer transitions 0/561 dead transitions. [2024-06-20 20:08:58,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 561 transitions, 10769 flow [2024-06-20 20:08:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 20:08:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 20:08:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2024-06-20 20:08:58,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49889135254988914 [2024-06-20 20:08:58,021 INFO L175 Difference]: Start difference. First operand has 285 places, 501 transitions, 8970 flow. Second operand 11 states and 225 transitions. [2024-06-20 20:08:58,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 561 transitions, 10769 flow [2024-06-20 20:08:59,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 561 transitions, 10568 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-20 20:08:59,949 INFO L231 Difference]: Finished difference. Result has 292 places, 515 transitions, 9295 flow [2024-06-20 20:08:59,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8769, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9295, PETRI_PLACES=292, PETRI_TRANSITIONS=515} [2024-06-20 20:08:59,950 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 250 predicate places. [2024-06-20 20:08:59,950 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 515 transitions, 9295 flow [2024-06-20 20:08:59,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:08:59,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:08:59,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:08:59,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 20:08:59,951 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:08:59,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:08:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1508623862, now seen corresponding path program 1 times [2024-06-20 20:08:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:08:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623267797] [2024-06-20 20:08:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:08:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:09:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:09:07,566 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-20 20:09:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:09:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623267797] [2024-06-20 20:09:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623267797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:09:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:09:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:09:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813336764] [2024-06-20 20:09:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:09:07,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:09:07,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:09:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:09:07,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:09:07,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:09:07,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 515 transitions, 9295 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:07,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:09:07,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:09:07,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:09:11,010 INFO L124 PetriNetUnfolderBase]: 6689/10785 cut-off events. [2024-06-20 20:09:11,010 INFO L125 PetriNetUnfolderBase]: For 898838/898838 co-relation queries the response was YES. [2024-06-20 20:09:11,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108389 conditions, 10785 events. 6689/10785 cut-off events. For 898838/898838 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 73336 event pairs, 2043 based on Foata normal form. 4/10783 useless extension candidates. Maximal degree in co-relation 108251. Up to 10220 conditions per place. [2024-06-20 20:09:11,164 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 506 selfloop transitions, 56 changer transitions 0/567 dead transitions. [2024-06-20 20:09:11,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 567 transitions, 11370 flow [2024-06-20 20:09:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:09:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:09:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 20:09:11,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-20 20:09:11,166 INFO L175 Difference]: Start difference. First operand has 292 places, 515 transitions, 9295 flow. Second operand 8 states and 151 transitions. [2024-06-20 20:09:11,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 567 transitions, 11370 flow [2024-06-20 20:09:13,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 567 transitions, 11173 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-20 20:09:13,495 INFO L231 Difference]: Finished difference. Result has 297 places, 542 transitions, 9909 flow [2024-06-20 20:09:13,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9104, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9909, PETRI_PLACES=297, PETRI_TRANSITIONS=542} [2024-06-20 20:09:13,495 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-20 20:09:13,495 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 542 transitions, 9909 flow [2024-06-20 20:09:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:13,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:09:13,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:09:13,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 20:09:13,496 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:09:13,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:09:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash 127272344, now seen corresponding path program 2 times [2024-06-20 20:09:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:09:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939204787] [2024-06-20 20:09:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:09:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:09:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:09:21,476 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-20 20:09:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:09:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939204787] [2024-06-20 20:09:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939204787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:09:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:09:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 20:09:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615391715] [2024-06-20 20:09:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:09:21,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 20:09:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:09:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 20:09:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 20:09:21,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:09:21,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 542 transitions, 9909 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:21,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:09:21,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:09:21,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:09:25,102 INFO L124 PetriNetUnfolderBase]: 6693/10800 cut-off events. [2024-06-20 20:09:25,103 INFO L125 PetriNetUnfolderBase]: For 902408/902408 co-relation queries the response was YES. [2024-06-20 20:09:25,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108223 conditions, 10800 events. 6693/10800 cut-off events. For 902408/902408 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 73502 event pairs, 2111 based on Foata normal form. 4/10801 useless extension candidates. Maximal degree in co-relation 108082. Up to 10362 conditions per place. [2024-06-20 20:09:25,248 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 519 selfloop transitions, 39 changer transitions 0/563 dead transitions. [2024-06-20 20:09:25,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 563 transitions, 11245 flow [2024-06-20 20:09:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 20:09:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 20:09:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 20:09:25,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-20 20:09:25,249 INFO L175 Difference]: Start difference. First operand has 297 places, 542 transitions, 9909 flow. Second operand 7 states and 131 transitions. [2024-06-20 20:09:25,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 563 transitions, 11245 flow [2024-06-20 20:09:27,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 563 transitions, 11169 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-20 20:09:27,419 INFO L231 Difference]: Finished difference. Result has 301 places, 548 transitions, 10084 flow [2024-06-20 20:09:27,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9837, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10084, PETRI_PLACES=301, PETRI_TRANSITIONS=548} [2024-06-20 20:09:27,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-20 20:09:27,419 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 548 transitions, 10084 flow [2024-06-20 20:09:27,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:27,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:09:27,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:09:27,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 20:09:27,420 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:09:27,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:09:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 812727583, now seen corresponding path program 7 times [2024-06-20 20:09:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:09:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042045515] [2024-06-20 20:09:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:09:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:09:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:09:34,871 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-20 20:09:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:09:34,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042045515] [2024-06-20 20:09:34,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042045515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:09:34,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:09:34,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:09:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991142169] [2024-06-20 20:09:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:09:34,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:09:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:09:34,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:09:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:09:35,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 20:09:35,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 548 transitions, 10084 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:35,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:09:35,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 20:09:35,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:09:39,151 INFO L124 PetriNetUnfolderBase]: 6879/11089 cut-off events. [2024-06-20 20:09:39,152 INFO L125 PetriNetUnfolderBase]: For 990374/990374 co-relation queries the response was YES. [2024-06-20 20:09:39,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112239 conditions, 11089 events. 6879/11089 cut-off events. For 990374/990374 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 75716 event pairs, 1770 based on Foata normal form. 16/11097 useless extension candidates. Maximal degree in co-relation 112097. Up to 9285 conditions per place. [2024-06-20 20:09:39,288 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 459 selfloop transitions, 148 changer transitions 0/612 dead transitions. [2024-06-20 20:09:39,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 612 transitions, 12664 flow [2024-06-20 20:09:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:09:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:09:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-06-20 20:09:39,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-20 20:09:39,289 INFO L175 Difference]: Start difference. First operand has 301 places, 548 transitions, 10084 flow. Second operand 9 states and 205 transitions. [2024-06-20 20:09:39,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 612 transitions, 12664 flow [2024-06-20 20:09:41,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 612 transitions, 12549 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-20 20:09:41,575 INFO L231 Difference]: Finished difference. Result has 308 places, 566 transitions, 10941 flow [2024-06-20 20:09:41,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9969, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10941, PETRI_PLACES=308, PETRI_TRANSITIONS=566} [2024-06-20 20:09:41,576 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2024-06-20 20:09:41,576 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 566 transitions, 10941 flow [2024-06-20 20:09:41,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:41,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:09:41,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:09:41,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 20:09:41,577 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:09:41,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:09:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 225895407, now seen corresponding path program 6 times [2024-06-20 20:09:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:09:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509913455] [2024-06-20 20:09:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:09:41,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:09:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:09:50,447 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-20 20:09:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:09:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509913455] [2024-06-20 20:09:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509913455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:09:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:09:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:09:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606793717] [2024-06-20 20:09:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:09:50,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:09:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:09:50,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:09:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:09:50,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-20 20:09:50,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 566 transitions, 10941 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:50,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:09:50,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-20 20:09:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:09:55,007 INFO L124 PetriNetUnfolderBase]: 7223/11666 cut-off events. [2024-06-20 20:09:55,008 INFO L125 PetriNetUnfolderBase]: For 1138192/1138192 co-relation queries the response was YES. [2024-06-20 20:09:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119843 conditions, 11666 events. 7223/11666 cut-off events. For 1138192/1138192 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 80504 event pairs, 1908 based on Foata normal form. 58/11716 useless extension candidates. Maximal degree in co-relation 119697. Up to 9874 conditions per place. [2024-06-20 20:09:55,182 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 492 selfloop transitions, 133 changer transitions 0/630 dead transitions. [2024-06-20 20:09:55,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 630 transitions, 13135 flow [2024-06-20 20:09:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 20:09:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 20:09:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2024-06-20 20:09:55,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49445676274944567 [2024-06-20 20:09:55,184 INFO L175 Difference]: Start difference. First operand has 308 places, 566 transitions, 10941 flow. Second operand 11 states and 223 transitions. [2024-06-20 20:09:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 630 transitions, 13135 flow [2024-06-20 20:09:57,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 630 transitions, 12912 flow, removed 93 selfloop flow, removed 3 redundant places. [2024-06-20 20:09:57,949 INFO L231 Difference]: Finished difference. Result has 317 places, 577 transitions, 11339 flow [2024-06-20 20:09:57,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10733, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11339, PETRI_PLACES=317, PETRI_TRANSITIONS=577} [2024-06-20 20:09:57,950 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-20 20:09:57,950 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 577 transitions, 11339 flow [2024-06-20 20:09:57,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:09:57,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:09:57,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:09:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 20:09:57,951 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:09:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:09:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1019801755, now seen corresponding path program 7 times [2024-06-20 20:09:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:09:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336846054] [2024-06-20 20:09:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:09:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:09:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:10:04,994 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-20 20:10:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:10:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336846054] [2024-06-20 20:10:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336846054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:10:04,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:10:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 20:10:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863335899] [2024-06-20 20:10:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:10:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 20:10:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:10:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 20:10:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 20:10:05,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 20:10:05,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 577 transitions, 11339 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:10:05,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:10:05,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 20:10:05,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:10:09,971 INFO L124 PetriNetUnfolderBase]: 7620/12393 cut-off events. [2024-06-20 20:10:09,971 INFO L125 PetriNetUnfolderBase]: For 1160573/1160573 co-relation queries the response was YES. [2024-06-20 20:10:10,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125181 conditions, 12393 events. 7620/12393 cut-off events. For 1160573/1160573 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 87076 event pairs, 2016 based on Foata normal form. 48/12433 useless extension candidates. Maximal degree in co-relation 125033. Up to 9834 conditions per place. [2024-06-20 20:10:10,488 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 498 selfloop transitions, 133 changer transitions 0/636 dead transitions. [2024-06-20 20:10:10,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 636 transitions, 13492 flow [2024-06-20 20:10:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 20:10:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 20:10:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-06-20 20:10:10,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292682926829269 [2024-06-20 20:10:10,489 INFO L175 Difference]: Start difference. First operand has 317 places, 577 transitions, 11339 flow. Second operand 10 states and 217 transitions. [2024-06-20 20:10:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 636 transitions, 13492 flow [2024-06-20 20:10:12,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 636 transitions, 13140 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-20 20:10:12,845 INFO L231 Difference]: Finished difference. Result has 321 places, 582 transitions, 11477 flow [2024-06-20 20:10:12,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10987, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11477, PETRI_PLACES=321, PETRI_TRANSITIONS=582} [2024-06-20 20:10:12,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places. [2024-06-20 20:10:12,846 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 582 transitions, 11477 flow [2024-06-20 20:10:12,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:10:12,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:10:12,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:10:12,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 20:10:12,847 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 20:10:12,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:10:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1591578213, now seen corresponding path program 8 times [2024-06-20 20:10:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:10:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969952896] [2024-06-20 20:10:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:10:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:10:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat