./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.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/mix028_power.opt_pso.opt_rmo.opt.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/mix028_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --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 18:52:16,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:52:16,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:52:16,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:52:16,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:52:16,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:52:16,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:52:16,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:52:16,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:52:16,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:52:16,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:52:16,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:52:16,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:52:16,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:52:16,446 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:52:16,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:52:16,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:52:16,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:52:16,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:52:16,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:52:16,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:52:16,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:52:16,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:52:16,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:52:16,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:52:16,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:52:16,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:52:16,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:52:16,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:52:16,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:52:16,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:52:16,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:52:16,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:52:16,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:52:16,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:52:16,452 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:52:16,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:52:16,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:52:16,454 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 18:52:16,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:52:16,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:52:16,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:52:16,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:52:16,718 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:52:16,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2024-06-20 18:52:17,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:52:18,158 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:52:18,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2024-06-20 18:52:18,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c918a6954/87171a8df8e74131a8791f43dcad3f4d/FLAG35ade493a [2024-06-20 18:52:18,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c918a6954/87171a8df8e74131a8791f43dcad3f4d [2024-06-20 18:52:18,190 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:52:18,191 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:52:18,191 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/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-20 18:52:18,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:52:18,377 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:52:18,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:52:18,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:52:18,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:52:18,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:52:18" (1/2) ... [2024-06-20 18:52:18,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ba05be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:52:18, skipping insertion in model container [2024-06-20 18:52:18,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:52:18" (1/2) ... [2024-06-20 18:52:18,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7df94aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:52:18, skipping insertion in model container [2024-06-20 18:52:18,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:52:18" (2/2) ... [2024-06-20 18:52:18,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ba05be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:52:18, skipping insertion in model container [2024-06-20 18:52:18,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:52:18" (2/2) ... [2024-06-20 18:52:18,387 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:52:18,474 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:52:18,475 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_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 )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (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 )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-20 18:52:18,476 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_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 )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (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 )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-20 18:52:18,476 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_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 )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (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 )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-20 18:52:18,477 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:52:18,477 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-20 18:52:18,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:52:18,917 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:52:18,927 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:52:19,295 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:52:19,337 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:52:19,337 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:52:19 WrapperNode [2024-06-20 18:52:19,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:52:19,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:52:19,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:52:19,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:52:19,345 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,385 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,520 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-20 18:52:19,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:52:19,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:52:19,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:52:19,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:52:19,533 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,533 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,569 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,623 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 18:52:19,626 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,627 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,670 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,672 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,687 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,693 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:52:19,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:52:19,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:52:19,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:52:19,714 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 06:52:19" (1/1) ... [2024-06-20 18:52:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:52:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:52:19,745 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 18:52:19,833 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 18:52:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:52:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:52:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:52:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:52:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:52:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:52:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 18:52:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 18:52:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:52:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:52:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:52:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:52:19,876 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 18:52:20,022 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:52:20,026 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:52:21,498 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:52:21,500 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:52:21,874 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:52:21,874 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:52:21,875 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:52:21 BoogieIcfgContainer [2024-06-20 18:52:21,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:52:21,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:52:21,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:52:21,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:52:21,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:52:18" (1/4) ... [2024-06-20 18:52:21,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c53ee22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:52:21, skipping insertion in model container [2024-06-20 18:52:21,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:52:18" (2/4) ... [2024-06-20 18:52:21,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c53ee22 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:52:21, skipping insertion in model container [2024-06-20 18:52:21,884 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 06:52:19" (3/4) ... [2024-06-20 18:52:21,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c53ee22 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:52:21, skipping insertion in model container [2024-06-20 18:52:21,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:52:21" (4/4) ... [2024-06-20 18:52:21,886 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2024-06-20 18:52:21,901 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:52:21,902 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 18:52:21,902 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:52:22,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:52:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 18:52:22,126 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-20 18:52:22,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:52:22,129 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 4. Compared 65 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 18:52:22,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 18:52:22,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-20 18:52:22,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:52:22,154 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;@3cc37e33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:52:22,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 18:52:22,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:52:22,165 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 18:52:22,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:52:22,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:22,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:52:22,166 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 18:52:22,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash 372680172, now seen corresponding path program 1 times [2024-06-20 18:52:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:22,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184424800] [2024-06-20 18:52:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:52:29,336 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 18:52:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:52:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184424800] [2024-06-20 18:52:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184424800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:52:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:52:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:52:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350267017] [2024-06-20 18:52:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:52:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:52:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:52:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:52:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:52:29,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:52:29,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 18:52:29,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:52:29,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:52:29,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:52:30,749 INFO L124 PetriNetUnfolderBase]: 1407/2237 cut-off events. [2024-06-20 18:52:30,750 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-06-20 18:52:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 2237 events. 1407/2237 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11042 event pairs, 989 based on Foata normal form. 1/2150 useless extension candidates. Maximal degree in co-relation 4429. Up to 2105 conditions per place. [2024-06-20 18:52:30,770 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-20 18:52:30,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-20 18:52:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:52:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:52:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-20 18:52:30,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-20 18:52:30,783 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 72 transitions. [2024-06-20 18:52:30,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-20 18:52:30,786 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 18:52:30,789 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-20 18:52:30,791 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 18:52:30,794 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-20 18:52:30,794 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-20 18:52:30,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 18:52:30,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:30,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:52:30,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:52:30,796 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 18:52:30,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1663882633, now seen corresponding path program 1 times [2024-06-20 18:52:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082649992] [2024-06-20 18:52:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:52:36,298 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 18:52:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:52:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082649992] [2024-06-20 18:52:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082649992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:52:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:52:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:52:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675865188] [2024-06-20 18:52:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:52:36,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:52:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:52:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:52:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:52:36,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:52:36,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 18:52:36,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:52:36,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:52:36,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:52:37,718 INFO L124 PetriNetUnfolderBase]: 1653/2528 cut-off events. [2024-06-20 18:52:37,719 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-06-20 18:52:37,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 2528 events. 1653/2528 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12068 event pairs, 1038 based on Foata normal form. 3/2519 useless extension candidates. Maximal degree in co-relation 5705. Up to 2441 conditions per place. [2024-06-20 18:52:37,736 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-20 18:52:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow [2024-06-20 18:52:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:52:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:52:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-20 18:52:37,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2024-06-20 18:52:37,741 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 90 transitions. [2024-06-20 18:52:37,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow [2024-06-20 18:52:37,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:52:37,744 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-20 18:52:37,745 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 18:52:37,746 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-20 18:52:37,746 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-20 18:52:37,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 18:52:37,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:37,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:52:37,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:52:37,750 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 18:52:37,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash 40755157, now seen corresponding path program 1 times [2024-06-20 18:52:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743291226] [2024-06-20 18:52:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:52:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:52:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:52:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743291226] [2024-06-20 18:52:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743291226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:52:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:52:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:52:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518086246] [2024-06-20 18:52:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:52:42,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:52:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:52:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:52:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:52:42,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:52:42,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 18:52:42,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:52:42,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:52:42,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:52:43,617 INFO L124 PetriNetUnfolderBase]: 1641/2510 cut-off events. [2024-06-20 18:52:43,618 INFO L125 PetriNetUnfolderBase]: For 1294/1294 co-relation queries the response was YES. [2024-06-20 18:52:43,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6286 conditions, 2510 events. 1641/2510 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11890 event pairs, 746 based on Foata normal form. 6/2504 useless extension candidates. Maximal degree in co-relation 6272. Up to 2393 conditions per place. [2024-06-20 18:52:43,633 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-20 18:52:43,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 322 flow [2024-06-20 18:52:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:52:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:52:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-20 18:52:43,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2024-06-20 18:52:43,640 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 111 transitions. [2024-06-20 18:52:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 322 flow [2024-06-20 18:52:43,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 18:52:43,644 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 172 flow [2024-06-20 18:52:43,644 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 18:52:43,646 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-06-20 18:52:43,646 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 172 flow [2024-06-20 18:52:43,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 18:52:43,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:43,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:52:43,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:52:43,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:52:43,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1204929134, now seen corresponding path program 1 times [2024-06-20 18:52:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:43,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464348689] [2024-06-20 18:52:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:52:49,234 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 18:52:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:52:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464348689] [2024-06-20 18:52:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464348689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:52:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:52:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:52:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777919117] [2024-06-20 18:52:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:52:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:52:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:52:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:52:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:52:49,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:52:49,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:52:49,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:52:49,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:52:49,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:52:50,665 INFO L124 PetriNetUnfolderBase]: 1632/2495 cut-off events. [2024-06-20 18:52:50,665 INFO L125 PetriNetUnfolderBase]: For 2395/2395 co-relation queries the response was YES. [2024-06-20 18:52:50,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6837 conditions, 2495 events. 1632/2495 cut-off events. For 2395/2395 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11828 event pairs, 582 based on Foata normal form. 6/2489 useless extension candidates. Maximal degree in co-relation 6822. Up to 2348 conditions per place. [2024-06-20 18:52:50,683 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 52 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-20 18:52:50,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 376 flow [2024-06-20 18:52:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:52:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:52:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-20 18:52:50,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2024-06-20 18:52:50,686 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 172 flow. Second operand 6 states and 127 transitions. [2024-06-20 18:52:50,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 376 flow [2024-06-20 18:52:50,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 18:52:50,692 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 191 flow [2024-06-20 18:52:50,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-06-20 18:52:50,694 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-20 18:52:50,694 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 191 flow [2024-06-20 18:52:50,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:52:50,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:50,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:52:50,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:52:50,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:52:50,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1788486672, now seen corresponding path program 1 times [2024-06-20 18:52:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239980503] [2024-06-20 18:52:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:52:57,581 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 18:52:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:52:57,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239980503] [2024-06-20 18:52:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239980503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:52:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:52:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:52:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594259125] [2024-06-20 18:52:57,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:52:57,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:52:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:52:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:52:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:52:57,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-20 18:52:57,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:52:57,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:52:57,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-20 18:52:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:52:58,617 INFO L124 PetriNetUnfolderBase]: 1375/2212 cut-off events. [2024-06-20 18:52:58,618 INFO L125 PetriNetUnfolderBase]: For 3103/3103 co-relation queries the response was YES. [2024-06-20 18:52:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 2212 events. 1375/2212 cut-off events. For 3103/3103 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10970 event pairs, 673 based on Foata normal form. 2/2178 useless extension candidates. Maximal degree in co-relation 6316. Up to 2047 conditions per place. [2024-06-20 18:52:58,631 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-06-20 18:52:58,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 337 flow [2024-06-20 18:52:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:52:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:52:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-20 18:52:58,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:52:58,633 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 191 flow. Second operand 5 states and 90 transitions. [2024-06-20 18:52:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 337 flow [2024-06-20 18:52:58,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 304 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 18:52:58,638 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 204 flow [2024-06-20 18:52:58,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-20 18:52:58,639 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-20 18:52:58,640 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 204 flow [2024-06-20 18:52:58,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:52:58,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:52:58,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:52:58,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:52:58,641 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 18:52:58,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:52:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 391489018, now seen corresponding path program 1 times [2024-06-20 18:52:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:52:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161490450] [2024-06-20 18:52:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:52:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:52:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:06,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 18:53:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161490450] [2024-06-20 18:53:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161490450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:53:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540314380] [2024-06-20 18:53:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:06,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:53:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:53:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:53:07,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:07,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:07,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:07,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:07,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:08,214 INFO L124 PetriNetUnfolderBase]: 1629/2504 cut-off events. [2024-06-20 18:53:08,214 INFO L125 PetriNetUnfolderBase]: For 5036/5036 co-relation queries the response was YES. [2024-06-20 18:53:08,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7754 conditions, 2504 events. 1629/2504 cut-off events. For 5036/5036 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11857 event pairs, 791 based on Foata normal form. 3/2507 useless extension candidates. Maximal degree in co-relation 7735. Up to 2382 conditions per place. [2024-06-20 18:53:08,231 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-20 18:53:08,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 458 flow [2024-06-20 18:53:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:53:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:53:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-20 18:53:08,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-20 18:53:08,233 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 204 flow. Second operand 6 states and 107 transitions. [2024-06-20 18:53:08,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 458 flow [2024-06-20 18:53:08,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 436 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 18:53:08,238 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 307 flow [2024-06-20 18:53:08,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2024-06-20 18:53:08,239 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-20 18:53:08,239 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 307 flow [2024-06-20 18:53:08,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:08,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:08,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:53:08,240 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 18:53:08,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash -361707221, now seen corresponding path program 1 times [2024-06-20 18:53:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907556005] [2024-06-20 18:53:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:14,319 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 18:53:14,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907556005] [2024-06-20 18:53:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907556005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:14,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:53:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273470734] [2024-06-20 18:53:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:14,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:53:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:53:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:53:14,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:14,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:14,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:14,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:14,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:15,591 INFO L124 PetriNetUnfolderBase]: 1697/2611 cut-off events. [2024-06-20 18:53:15,592 INFO L125 PetriNetUnfolderBase]: For 7867/7877 co-relation queries the response was YES. [2024-06-20 18:53:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9050 conditions, 2611 events. 1697/2611 cut-off events. For 7867/7877 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12352 event pairs, 793 based on Foata normal form. 2/2601 useless extension candidates. Maximal degree in co-relation 9028. Up to 2473 conditions per place. [2024-06-20 18:53:15,605 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 59 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2024-06-20 18:53:15,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 517 flow [2024-06-20 18:53:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:53:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:53:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-20 18:53:15,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-20 18:53:15,606 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 307 flow. Second operand 6 states and 104 transitions. [2024-06-20 18:53:15,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 517 flow [2024-06-20 18:53:15,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 501 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-20 18:53:15,612 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 351 flow [2024-06-20 18:53:15,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2024-06-20 18:53:15,613 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2024-06-20 18:53:15,613 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 351 flow [2024-06-20 18:53:15,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:15,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:15,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:15,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:53:15,614 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 18:53:15,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -748749233, now seen corresponding path program 2 times [2024-06-20 18:53:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728560633] [2024-06-20 18:53:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:23,182 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 18:53:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728560633] [2024-06-20 18:53:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728560633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:23,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:53:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514194309] [2024-06-20 18:53:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:23,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:53:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:53:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:53:23,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:23,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:23,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:23,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:24,230 INFO L124 PetriNetUnfolderBase]: 1692/2606 cut-off events. [2024-06-20 18:53:24,230 INFO L125 PetriNetUnfolderBase]: For 10116/10136 co-relation queries the response was YES. [2024-06-20 18:53:24,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9612 conditions, 2606 events. 1692/2606 cut-off events. For 10116/10136 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12415 event pairs, 800 based on Foata normal form. 10/2604 useless extension candidates. Maximal degree in co-relation 9587. Up to 2448 conditions per place. [2024-06-20 18:53:24,244 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2024-06-20 18:53:24,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 559 flow [2024-06-20 18:53:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:53:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:53:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-20 18:53:24,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-20 18:53:24,246 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 351 flow. Second operand 6 states and 103 transitions. [2024-06-20 18:53:24,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 559 flow [2024-06-20 18:53:24,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 523 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 18:53:24,252 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 391 flow [2024-06-20 18:53:24,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-06-20 18:53:24,253 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-20 18:53:24,253 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 391 flow [2024-06-20 18:53:24,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 18:53:24,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:24,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:24,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:53:24,254 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 18:53:24,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -748741297, now seen corresponding path program 1 times [2024-06-20 18:53:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757397257] [2024-06-20 18:53:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:31,881 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 18:53:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757397257] [2024-06-20 18:53:31,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757397257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:31,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:31,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:53:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948146912] [2024-06-20 18:53:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:31,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:53:31,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:53:31,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:53:32,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:32,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 391 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:32,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:32,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:32,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:33,094 INFO L124 PetriNetUnfolderBase]: 1637/2542 cut-off events. [2024-06-20 18:53:33,094 INFO L125 PetriNetUnfolderBase]: For 12161/12161 co-relation queries the response was YES. [2024-06-20 18:53:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9899 conditions, 2542 events. 1637/2542 cut-off events. For 12161/12161 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12168 event pairs, 755 based on Foata normal form. 3/2545 useless extension candidates. Maximal degree in co-relation 9873. Up to 2381 conditions per place. [2024-06-20 18:53:33,113 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 62 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2024-06-20 18:53:33,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 673 flow [2024-06-20 18:53:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:53:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:53:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-20 18:53:33,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-20 18:53:33,115 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 391 flow. Second operand 7 states and 123 transitions. [2024-06-20 18:53:33,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 673 flow [2024-06-20 18:53:33,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 621 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 18:53:33,123 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 430 flow [2024-06-20 18:53:33,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-20 18:53:33,124 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-20 18:53:33,124 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 430 flow [2024-06-20 18:53:33,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:33,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:33,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:33,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:53:33,125 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 18:53:33,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1671858883, now seen corresponding path program 1 times [2024-06-20 18:53:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383323126] [2024-06-20 18:53:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:40,706 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 18:53:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383323126] [2024-06-20 18:53:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383323126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:53:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927382499] [2024-06-20 18:53:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:40,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:53:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:53:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:53:40,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:40,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:40,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:40,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:40,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:41,943 INFO L124 PetriNetUnfolderBase]: 1756/2679 cut-off events. [2024-06-20 18:53:41,944 INFO L125 PetriNetUnfolderBase]: For 16886/16905 co-relation queries the response was YES. [2024-06-20 18:53:41,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11333 conditions, 2679 events. 1756/2679 cut-off events. For 16886/16905 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12552 event pairs, 680 based on Foata normal form. 5/2678 useless extension candidates. Maximal degree in co-relation 11306. Up to 2493 conditions per place. [2024-06-20 18:53:41,960 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 73 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2024-06-20 18:53:41,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 720 flow [2024-06-20 18:53:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:53:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:53:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-20 18:53:41,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-20 18:53:41,962 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 430 flow. Second operand 7 states and 124 transitions. [2024-06-20 18:53:41,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 720 flow [2024-06-20 18:53:41,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 659 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 18:53:41,971 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 467 flow [2024-06-20 18:53:41,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=467, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2024-06-20 18:53:41,972 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-20 18:53:41,973 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 467 flow [2024-06-20 18:53:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:41,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:41,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:53:41,974 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 18:53:41,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1911736509, now seen corresponding path program 2 times [2024-06-20 18:53:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688725180] [2024-06-20 18:53:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:49,672 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 18:53:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688725180] [2024-06-20 18:53:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688725180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:53:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207286373] [2024-06-20 18:53:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:53:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:53:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:53:49,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:53:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 467 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:49,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:49,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:53:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:50,914 INFO L124 PetriNetUnfolderBase]: 1794/2730 cut-off events. [2024-06-20 18:53:50,914 INFO L125 PetriNetUnfolderBase]: For 21166/21197 co-relation queries the response was YES. [2024-06-20 18:53:50,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12349 conditions, 2730 events. 1794/2730 cut-off events. For 21166/21197 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12791 event pairs, 667 based on Foata normal form. 5/2723 useless extension candidates. Maximal degree in co-relation 12320. Up to 2510 conditions per place. [2024-06-20 18:53:50,932 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 24 changer transitions 0/104 dead transitions. [2024-06-20 18:53:50,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 847 flow [2024-06-20 18:53:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:53:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:53:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:53:50,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:53:50,935 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 467 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:53:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 847 flow [2024-06-20 18:53:50,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 801 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-20 18:53:50,948 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 563 flow [2024-06-20 18:53:50,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=563, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2024-06-20 18:53:50,949 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-20 18:53:50,949 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 563 flow [2024-06-20 18:53:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:53:50,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:50,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:53:50,950 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 18:53:50,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1911736323, now seen corresponding path program 1 times [2024-06-20 18:53:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991617230] [2024-06-20 18:53:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:53:58,410 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 18:53:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:53:58,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991617230] [2024-06-20 18:53:58,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991617230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:53:58,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:53:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:53:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618777290] [2024-06-20 18:53:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:53:58,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:53:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:53:58,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:53:58,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:53:58,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:53:58,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 563 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:53:58,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:53:58,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:53:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:53:59,718 INFO L124 PetriNetUnfolderBase]: 1983/2938 cut-off events. [2024-06-20 18:53:59,718 INFO L125 PetriNetUnfolderBase]: For 25807/25807 co-relation queries the response was YES. [2024-06-20 18:53:59,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13919 conditions, 2938 events. 1983/2938 cut-off events. For 25807/25807 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13322 event pairs, 691 based on Foata normal form. 3/2941 useless extension candidates. Maximal degree in co-relation 13889. Up to 2867 conditions per place. [2024-06-20 18:53:59,734 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 89 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-06-20 18:53:59,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 1013 flow [2024-06-20 18:53:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:53:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:53:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-20 18:53:59,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-20 18:53:59,736 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 563 flow. Second operand 7 states and 121 transitions. [2024-06-20 18:53:59,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 1013 flow [2024-06-20 18:53:59,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 963 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-20 18:53:59,755 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 695 flow [2024-06-20 18:53:59,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=695, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2024-06-20 18:53:59,756 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-20 18:53:59,756 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 695 flow [2024-06-20 18:53:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:53:59,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:53:59,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:53:59,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:53:59,757 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 18:53:59,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:53:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1734604989, now seen corresponding path program 3 times [2024-06-20 18:53:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:53:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801437020] [2024-06-20 18:53:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:53:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:53:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:06,841 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 18:54:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:06,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801437020] [2024-06-20 18:54:06,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801437020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:06,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:06,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:54:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675600108] [2024-06-20 18:54:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:06,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:54:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:06,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:54:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:54:06,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:54:06,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 695 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:54:06,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:06,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:54:06,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:08,082 INFO L124 PetriNetUnfolderBase]: 1842/2797 cut-off events. [2024-06-20 18:54:08,082 INFO L125 PetriNetUnfolderBase]: For 31077/31104 co-relation queries the response was YES. [2024-06-20 18:54:08,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14157 conditions, 2797 events. 1842/2797 cut-off events. For 31077/31104 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13082 event pairs, 663 based on Foata normal form. 9/2800 useless extension candidates. Maximal degree in co-relation 14123. Up to 2523 conditions per place. [2024-06-20 18:54:08,095 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 73 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-20 18:54:08,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 115 transitions, 1061 flow [2024-06-20 18:54:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:54:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:54:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-20 18:54:08,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-20 18:54:08,099 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 695 flow. Second operand 7 states and 125 transitions. [2024-06-20 18:54:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 115 transitions, 1061 flow [2024-06-20 18:54:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 1009 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-20 18:54:08,122 INFO L231 Difference]: Finished difference. Result has 84 places, 92 transitions, 769 flow [2024-06-20 18:54:08,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=769, PETRI_PLACES=84, PETRI_TRANSITIONS=92} [2024-06-20 18:54:08,123 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-20 18:54:08,123 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 769 flow [2024-06-20 18:54:08,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:54:08,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:08,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:08,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:54:08,124 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:54:08,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2092205119, now seen corresponding path program 2 times [2024-06-20 18:54:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:08,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982045809] [2024-06-20 18:54:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:15,352 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 18:54:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982045809] [2024-06-20 18:54:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982045809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:15,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:54:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439941850] [2024-06-20 18:54:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:15,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:54:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:54:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:54:15,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:54:15,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 92 transitions, 769 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:54:15,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:15,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:54:15,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:16,796 INFO L124 PetriNetUnfolderBase]: 1991/2952 cut-off events. [2024-06-20 18:54:16,796 INFO L125 PetriNetUnfolderBase]: For 35763/35775 co-relation queries the response was YES. [2024-06-20 18:54:16,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15608 conditions, 2952 events. 1991/2952 cut-off events. For 35763/35775 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13432 event pairs, 684 based on Foata normal form. 15/2967 useless extension candidates. Maximal degree in co-relation 15572. Up to 2793 conditions per place. [2024-06-20 18:54:16,812 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 87 selfloop transitions, 34 changer transitions 0/124 dead transitions. [2024-06-20 18:54:16,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 124 transitions, 1293 flow [2024-06-20 18:54:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:54:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:54:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 18:54:16,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-20 18:54:16,814 INFO L175 Difference]: Start difference. First operand has 84 places, 92 transitions, 769 flow. Second operand 7 states and 122 transitions. [2024-06-20 18:54:16,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 124 transitions, 1293 flow [2024-06-20 18:54:16,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 1191 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-20 18:54:16,833 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 859 flow [2024-06-20 18:54:16,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=859, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2024-06-20 18:54:16,834 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-20 18:54:16,834 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 859 flow [2024-06-20 18:54:16,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:54:16,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:16,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:16,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:54:16,835 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 18:54:16,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1736151591, now seen corresponding path program 3 times [2024-06-20 18:54:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:16,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318529809] [2024-06-20 18:54:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:24,022 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 18:54:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318529809] [2024-06-20 18:54:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318529809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:24,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:54:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999860417] [2024-06-20 18:54:24,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:24,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:54:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:54:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:54:24,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:54:24,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 859 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:54:24,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:24,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:54:24,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:25,308 INFO L124 PetriNetUnfolderBase]: 1993/2955 cut-off events. [2024-06-20 18:54:25,308 INFO L125 PetriNetUnfolderBase]: For 41047/41059 co-relation queries the response was YES. [2024-06-20 18:54:25,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16363 conditions, 2955 events. 1993/2955 cut-off events. For 41047/41059 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13432 event pairs, 684 based on Foata normal form. 15/2970 useless extension candidates. Maximal degree in co-relation 16325. Up to 2798 conditions per place. [2024-06-20 18:54:25,324 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 80 selfloop transitions, 42 changer transitions 0/125 dead transitions. [2024-06-20 18:54:25,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 125 transitions, 1274 flow [2024-06-20 18:54:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:54:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:54:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-20 18:54:25,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-20 18:54:25,325 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 859 flow. Second operand 7 states and 120 transitions. [2024-06-20 18:54:25,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 125 transitions, 1274 flow [2024-06-20 18:54:25,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 125 transitions, 1157 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-20 18:54:25,351 INFO L231 Difference]: Finished difference. Result has 90 places, 104 transitions, 900 flow [2024-06-20 18:54:25,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=900, PETRI_PLACES=90, PETRI_TRANSITIONS=104} [2024-06-20 18:54:25,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-20 18:54:25,352 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 900 flow [2024-06-20 18:54:25,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 18:54:25,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:25,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:25,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:54:25,352 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 18:54:25,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1736142663, now seen corresponding path program 1 times [2024-06-20 18:54:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604687174] [2024-06-20 18:54:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:34,318 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 18:54:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604687174] [2024-06-20 18:54:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604687174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:54:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844955058] [2024-06-20 18:54:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:34,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:54:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:34,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:54:34,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:54:34,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:54:34,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 900 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 18:54:34,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:34,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:54:34,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:35,563 INFO L124 PetriNetUnfolderBase]: 1744/2703 cut-off events. [2024-06-20 18:54:35,563 INFO L125 PetriNetUnfolderBase]: For 37623/37623 co-relation queries the response was YES. [2024-06-20 18:54:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14578 conditions, 2703 events. 1744/2703 cut-off events. For 37623/37623 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12916 event pairs, 560 based on Foata normal form. 6/2709 useless extension candidates. Maximal degree in co-relation 14539. Up to 2510 conditions per place. [2024-06-20 18:54:35,578 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 105 selfloop transitions, 24 changer transitions 0/133 dead transitions. [2024-06-20 18:54:35,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 133 transitions, 1332 flow [2024-06-20 18:54:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:54:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:54:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 18:54:35,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-20 18:54:35,579 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 900 flow. Second operand 8 states and 139 transitions. [2024-06-20 18:54:35,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 133 transitions, 1332 flow [2024-06-20 18:54:35,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 1241 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-20 18:54:35,602 INFO L231 Difference]: Finished difference. Result has 94 places, 107 transitions, 921 flow [2024-06-20 18:54:35,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=921, PETRI_PLACES=94, PETRI_TRANSITIONS=107} [2024-06-20 18:54:35,602 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-20 18:54:35,602 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 107 transitions, 921 flow [2024-06-20 18:54:35,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 18:54:35,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:35,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:35,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:54:35,603 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:54:35,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2061105833, now seen corresponding path program 1 times [2024-06-20 18:54:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228147739] [2024-06-20 18:54:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:47,653 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 18:54:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228147739] [2024-06-20 18:54:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228147739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:47,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:54:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253935275] [2024-06-20 18:54:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:47,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:54:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:54:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:54:47,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:54:47,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 107 transitions, 921 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 18:54:47,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:47,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:54:47,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:48,786 INFO L124 PetriNetUnfolderBase]: 1741/2698 cut-off events. [2024-06-20 18:54:48,786 INFO L125 PetriNetUnfolderBase]: For 40522/40522 co-relation queries the response was YES. [2024-06-20 18:54:48,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14927 conditions, 2698 events. 1741/2698 cut-off events. For 40522/40522 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12871 event pairs, 579 based on Foata normal form. 1/2699 useless extension candidates. Maximal degree in co-relation 14887. Up to 2579 conditions per place. [2024-06-20 18:54:48,803 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 103 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-06-20 18:54:48,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 115 transitions, 1163 flow [2024-06-20 18:54:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:54:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:54:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-20 18:54:48,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 18:54:48,805 INFO L175 Difference]: Start difference. First operand has 94 places, 107 transitions, 921 flow. Second operand 5 states and 82 transitions. [2024-06-20 18:54:48,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 115 transitions, 1163 flow [2024-06-20 18:54:48,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 1065 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-20 18:54:48,833 INFO L231 Difference]: Finished difference. Result has 93 places, 107 transitions, 845 flow [2024-06-20 18:54:48,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=845, PETRI_PLACES=93, PETRI_TRANSITIONS=107} [2024-06-20 18:54:48,834 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-20 18:54:48,834 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 107 transitions, 845 flow [2024-06-20 18:54:48,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 18:54:48,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:48,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:48,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:54:48,835 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 18:54:48,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash 861901932, now seen corresponding path program 1 times [2024-06-20 18:54:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:48,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465006568] [2024-06-20 18:54:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:54:56,578 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 18:54:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:54:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465006568] [2024-06-20 18:54:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465006568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:54:56,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:54:56,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:54:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341946822] [2024-06-20 18:54:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:54:56,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:54:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:54:56,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:54:56,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:54:56,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:54:56,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 107 transitions, 845 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 18:54:56,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:54:56,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:54:56,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:54:57,890 INFO L124 PetriNetUnfolderBase]: 1855/2814 cut-off events. [2024-06-20 18:54:57,890 INFO L125 PetriNetUnfolderBase]: For 49865/49867 co-relation queries the response was YES. [2024-06-20 18:54:57,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15941 conditions, 2814 events. 1855/2814 cut-off events. For 49865/49867 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13138 event pairs, 637 based on Foata normal form. 4/2818 useless extension candidates. Maximal degree in co-relation 15900. Up to 2601 conditions per place. [2024-06-20 18:54:57,904 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 99 selfloop transitions, 19 changer transitions 0/133 dead transitions. [2024-06-20 18:54:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 133 transitions, 1149 flow [2024-06-20 18:54:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:54:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:54:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-20 18:54:57,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-20 18:54:57,907 INFO L175 Difference]: Start difference. First operand has 93 places, 107 transitions, 845 flow. Second operand 7 states and 124 transitions. [2024-06-20 18:54:57,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 133 transitions, 1149 flow [2024-06-20 18:54:57,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 133 transitions, 1105 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 18:54:57,929 INFO L231 Difference]: Finished difference. Result has 96 places, 107 transitions, 851 flow [2024-06-20 18:54:57,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2024-06-20 18:54:57,929 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-20 18:54:57,930 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 851 flow [2024-06-20 18:54:57,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 18:54:57,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:54:57,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:54:57,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:54:57,930 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 18:54:57,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:54:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 861992297, now seen corresponding path program 1 times [2024-06-20 18:54:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:54:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792463433] [2024-06-20 18:54:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:54:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:54:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:05,110 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 18:55:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792463433] [2024-06-20 18:55:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792463433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:05,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793657754] [2024-06-20 18:55:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:05,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:05,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:05,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 107 transitions, 851 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:05,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:05,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:06,570 INFO L124 PetriNetUnfolderBase]: 2056/3043 cut-off events. [2024-06-20 18:55:06,570 INFO L125 PetriNetUnfolderBase]: For 55963/55963 co-relation queries the response was YES. [2024-06-20 18:55:06,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17519 conditions, 3043 events. 2056/3043 cut-off events. For 55963/55963 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13797 event pairs, 663 based on Foata normal form. 6/3049 useless extension candidates. Maximal degree in co-relation 17478. Up to 2886 conditions per place. [2024-06-20 18:55:06,588 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 120 selfloop transitions, 32 changer transitions 0/155 dead transitions. [2024-06-20 18:55:06,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 155 transitions, 1519 flow [2024-06-20 18:55:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-20 18:55:06,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-20 18:55:06,590 INFO L175 Difference]: Start difference. First operand has 96 places, 107 transitions, 851 flow. Second operand 8 states and 142 transitions. [2024-06-20 18:55:06,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 155 transitions, 1519 flow [2024-06-20 18:55:06,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 155 transitions, 1473 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 18:55:06,621 INFO L231 Difference]: Finished difference. Result has 100 places, 121 transitions, 1077 flow [2024-06-20 18:55:06,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1077, PETRI_PLACES=100, PETRI_TRANSITIONS=121} [2024-06-20 18:55:06,622 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-20 18:55:06,622 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 121 transitions, 1077 flow [2024-06-20 18:55:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:06,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:06,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:06,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:55:06,622 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:55:06,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 865711367, now seen corresponding path program 2 times [2024-06-20 18:55:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949577183] [2024-06-20 18:55:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:13,937 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 18:55:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:13,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949577183] [2024-06-20 18:55:13,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949577183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:13,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482206355] [2024-06-20 18:55:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:13,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:14,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:14,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 121 transitions, 1077 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:14,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:14,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:14,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:15,385 INFO L124 PetriNetUnfolderBase]: 2308/3400 cut-off events. [2024-06-20 18:55:15,385 INFO L125 PetriNetUnfolderBase]: For 73486/73486 co-relation queries the response was YES. [2024-06-20 18:55:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21319 conditions, 3400 events. 2308/3400 cut-off events. For 73486/73486 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15680 event pairs, 629 based on Foata normal form. 6/3406 useless extension candidates. Maximal degree in co-relation 21275. Up to 2898 conditions per place. [2024-06-20 18:55:15,404 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 125 selfloop transitions, 44 changer transitions 0/172 dead transitions. [2024-06-20 18:55:15,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 172 transitions, 1961 flow [2024-06-20 18:55:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:55:15,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:55:15,406 INFO L175 Difference]: Start difference. First operand has 100 places, 121 transitions, 1077 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:55:15,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 172 transitions, 1961 flow [2024-06-20 18:55:15,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1857 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-20 18:55:15,451 INFO L231 Difference]: Finished difference. Result has 107 places, 134 transitions, 1292 flow [2024-06-20 18:55:15,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1292, PETRI_PLACES=107, PETRI_TRANSITIONS=134} [2024-06-20 18:55:15,452 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-20 18:55:15,452 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 134 transitions, 1292 flow [2024-06-20 18:55:15,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:15,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:15,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:15,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:55:15,453 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 18:55:15,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash 291743690, now seen corresponding path program 1 times [2024-06-20 18:55:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643278984] [2024-06-20 18:55:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:23,480 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 18:55:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643278984] [2024-06-20 18:55:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643278984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399149132] [2024-06-20 18:55:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:23,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:23,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:23,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 134 transitions, 1292 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:23,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:23,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:23,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:25,023 INFO L124 PetriNetUnfolderBase]: 2344/3452 cut-off events. [2024-06-20 18:55:25,023 INFO L125 PetriNetUnfolderBase]: For 81409/81409 co-relation queries the response was YES. [2024-06-20 18:55:25,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22867 conditions, 3452 events. 2344/3452 cut-off events. For 81409/81409 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15925 event pairs, 631 based on Foata normal form. 9/3461 useless extension candidates. Maximal degree in co-relation 22820. Up to 3010 conditions per place. [2024-06-20 18:55:25,046 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 119 selfloop transitions, 63 changer transitions 0/185 dead transitions. [2024-06-20 18:55:25,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 185 transitions, 2207 flow [2024-06-20 18:55:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 18:55:25,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-20 18:55:25,049 INFO L175 Difference]: Start difference. First operand has 107 places, 134 transitions, 1292 flow. Second operand 8 states and 145 transitions. [2024-06-20 18:55:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 185 transitions, 2207 flow [2024-06-20 18:55:25,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 185 transitions, 2082 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-20 18:55:25,121 INFO L231 Difference]: Finished difference. Result has 113 places, 152 transitions, 1664 flow [2024-06-20 18:55:25,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1664, PETRI_PLACES=113, PETRI_TRANSITIONS=152} [2024-06-20 18:55:25,122 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-20 18:55:25,122 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 152 transitions, 1664 flow [2024-06-20 18:55:25,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:25,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:25,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:25,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:55:25,123 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 18:55:25,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 865716947, now seen corresponding path program 3 times [2024-06-20 18:55:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845699932] [2024-06-20 18:55:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:32,582 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 18:55:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845699932] [2024-06-20 18:55:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845699932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:32,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212251023] [2024-06-20 18:55:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:32,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:32,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:32,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 152 transitions, 1664 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:32,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:32,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:34,074 INFO L124 PetriNetUnfolderBase]: 2333/3437 cut-off events. [2024-06-20 18:55:34,074 INFO L125 PetriNetUnfolderBase]: For 87243/87243 co-relation queries the response was YES. [2024-06-20 18:55:34,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23396 conditions, 3437 events. 2333/3437 cut-off events. For 87243/87243 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15829 event pairs, 622 based on Foata normal form. 12/3449 useless extension candidates. Maximal degree in co-relation 23346. Up to 2937 conditions per place. [2024-06-20 18:55:34,146 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 120 selfloop transitions, 67 changer transitions 0/190 dead transitions. [2024-06-20 18:55:34,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 190 transitions, 2404 flow [2024-06-20 18:55:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:55:34,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:55:34,148 INFO L175 Difference]: Start difference. First operand has 113 places, 152 transitions, 1664 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:55:34,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 190 transitions, 2404 flow [2024-06-20 18:55:34,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 190 transitions, 2293 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-20 18:55:34,215 INFO L231 Difference]: Finished difference. Result has 118 places, 157 transitions, 1817 flow [2024-06-20 18:55:34,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1817, PETRI_PLACES=118, PETRI_TRANSITIONS=157} [2024-06-20 18:55:34,215 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-20 18:55:34,215 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 157 transitions, 1817 flow [2024-06-20 18:55:34,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:34,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:34,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:34,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 18:55:34,216 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:55:34,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2013876343, now seen corresponding path program 4 times [2024-06-20 18:55:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852268037] [2024-06-20 18:55:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:55:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852268037] [2024-06-20 18:55:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852268037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816902139] [2024-06-20 18:55:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:41,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:41,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:41,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 157 transitions, 1817 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:41,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:41,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:41,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:42,996 INFO L124 PetriNetUnfolderBase]: 2523/3713 cut-off events. [2024-06-20 18:55:42,996 INFO L125 PetriNetUnfolderBase]: For 101869/101875 co-relation queries the response was YES. [2024-06-20 18:55:43,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25656 conditions, 3713 events. 2523/3713 cut-off events. For 101869/101875 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17370 event pairs, 616 based on Foata normal form. 16/3729 useless extension candidates. Maximal degree in co-relation 25604. Up to 2761 conditions per place. [2024-06-20 18:55:43,020 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 110 selfloop transitions, 100 changer transitions 0/213 dead transitions. [2024-06-20 18:55:43,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 213 transitions, 2957 flow [2024-06-20 18:55:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 18:55:43,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:55:43,021 INFO L175 Difference]: Start difference. First operand has 118 places, 157 transitions, 1817 flow. Second operand 8 states and 152 transitions. [2024-06-20 18:55:43,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 213 transitions, 2957 flow [2024-06-20 18:55:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 213 transitions, 2800 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-20 18:55:43,092 INFO L231 Difference]: Finished difference. Result has 124 places, 175 transitions, 2264 flow [2024-06-20 18:55:43,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2264, PETRI_PLACES=124, PETRI_TRANSITIONS=175} [2024-06-20 18:55:43,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-20 18:55:43,093 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 175 transitions, 2264 flow [2024-06-20 18:55:43,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:43,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:43,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:43,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 18:55:43,094 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 18:55:43,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2013876560, now seen corresponding path program 2 times [2024-06-20 18:55:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136011953] [2024-06-20 18:55:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:55:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:55:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:55:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136011953] [2024-06-20 18:55:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136011953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:55:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:55:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:55:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719385623] [2024-06-20 18:55:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:55:51,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:55:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:55:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:55:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:55:51,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:55:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 175 transitions, 2264 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:55:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:55:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:55:53,283 INFO L124 PetriNetUnfolderBase]: 2529/3723 cut-off events. [2024-06-20 18:55:53,284 INFO L125 PetriNetUnfolderBase]: For 110926/110932 co-relation queries the response was YES. [2024-06-20 18:55:53,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27230 conditions, 3723 events. 2529/3723 cut-off events. For 110926/110932 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17390 event pairs, 617 based on Foata normal form. 13/3736 useless extension candidates. Maximal degree in co-relation 27175. Up to 3123 conditions per place. [2024-06-20 18:55:53,312 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 123 selfloop transitions, 94 changer transitions 0/220 dead transitions. [2024-06-20 18:55:53,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 220 transitions, 3273 flow [2024-06-20 18:55:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:55:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:55:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:55:53,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:55:53,317 INFO L175 Difference]: Start difference. First operand has 124 places, 175 transitions, 2264 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:55:53,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 220 transitions, 3273 flow [2024-06-20 18:55:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 220 transitions, 3060 flow, removed 98 selfloop flow, removed 2 redundant places. [2024-06-20 18:55:53,424 INFO L231 Difference]: Finished difference. Result has 133 places, 189 transitions, 2693 flow [2024-06-20 18:55:53,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2693, PETRI_PLACES=133, PETRI_TRANSITIONS=189} [2024-06-20 18:55:53,425 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-20 18:55:53,425 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 189 transitions, 2693 flow [2024-06-20 18:55:53,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:55:53,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:55:53,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:55:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 18:55:53,426 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 18:55:53,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:55:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2014143470, now seen corresponding path program 3 times [2024-06-20 18:55:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:55:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332324284] [2024-06-20 18:55:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:55:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:55:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:02,134 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 18:56:02,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332324284] [2024-06-20 18:56:02,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332324284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:02,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:02,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:56:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152981216] [2024-06-20 18:56:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:02,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:56:02,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:56:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:56:02,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:56:02,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 189 transitions, 2693 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:02,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:02,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:56:02,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:03,762 INFO L124 PetriNetUnfolderBase]: 2565/3773 cut-off events. [2024-06-20 18:56:03,763 INFO L125 PetriNetUnfolderBase]: For 114889/114895 co-relation queries the response was YES. [2024-06-20 18:56:03,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28083 conditions, 3773 events. 2565/3773 cut-off events. For 114889/114895 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17664 event pairs, 612 based on Foata normal form. 7/3780 useless extension candidates. Maximal degree in co-relation 28023. Up to 2996 conditions per place. [2024-06-20 18:56:03,789 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 112 selfloop transitions, 111 changer transitions 0/226 dead transitions. [2024-06-20 18:56:03,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 226 transitions, 3606 flow [2024-06-20 18:56:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:56:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:56:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-20 18:56:03,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-20 18:56:03,790 INFO L175 Difference]: Start difference. First operand has 133 places, 189 transitions, 2693 flow. Second operand 8 states and 148 transitions. [2024-06-20 18:56:03,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 226 transitions, 3606 flow [2024-06-20 18:56:03,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 226 transitions, 3485 flow, removed 52 selfloop flow, removed 2 redundant places. [2024-06-20 18:56:03,890 INFO L231 Difference]: Finished difference. Result has 140 places, 194 transitions, 2943 flow [2024-06-20 18:56:03,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2572, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2943, PETRI_PLACES=140, PETRI_TRANSITIONS=194} [2024-06-20 18:56:03,891 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-20 18:56:03,891 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 194 transitions, 2943 flow [2024-06-20 18:56:03,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:03,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:03,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:03,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 18:56:03,892 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 18:56:03,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2061826988, now seen corresponding path program 4 times [2024-06-20 18:56:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704606462] [2024-06-20 18:56:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:11,969 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 18:56:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704606462] [2024-06-20 18:56:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704606462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:56:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72238628] [2024-06-20 18:56:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:11,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:56:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:56:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:56:12,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:56:12,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 194 transitions, 2943 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:12,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:12,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:56:12,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:13,540 INFO L124 PetriNetUnfolderBase]: 2553/3759 cut-off events. [2024-06-20 18:56:13,540 INFO L125 PetriNetUnfolderBase]: For 122822/122828 co-relation queries the response was YES. [2024-06-20 18:56:13,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28916 conditions, 3759 events. 2553/3759 cut-off events. For 122822/122828 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17569 event pairs, 637 based on Foata normal form. 13/3772 useless extension candidates. Maximal degree in co-relation 28853. Up to 3153 conditions per place. [2024-06-20 18:56:13,572 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 146 selfloop transitions, 78 changer transitions 0/227 dead transitions. [2024-06-20 18:56:13,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 227 transitions, 3773 flow [2024-06-20 18:56:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:56:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:56:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 18:56:13,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 18:56:13,574 INFO L175 Difference]: Start difference. First operand has 140 places, 194 transitions, 2943 flow. Second operand 8 states and 149 transitions. [2024-06-20 18:56:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 227 transitions, 3773 flow [2024-06-20 18:56:13,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 227 transitions, 3546 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-20 18:56:13,722 INFO L231 Difference]: Finished difference. Result has 143 places, 194 transitions, 2883 flow [2024-06-20 18:56:13,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2883, PETRI_PLACES=143, PETRI_TRANSITIONS=194} [2024-06-20 18:56:13,723 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-20 18:56:13,723 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 194 transitions, 2883 flow [2024-06-20 18:56:13,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:13,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:13,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 18:56:13,724 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:56:13,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2006524693, now seen corresponding path program 5 times [2024-06-20 18:56:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:13,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287633567] [2024-06-20 18:56:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:22,056 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 18:56:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287633567] [2024-06-20 18:56:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287633567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:56:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481591113] [2024-06-20 18:56:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:56:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:56:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:56:22,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:56:22,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 194 transitions, 2883 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:22,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:22,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:56:22,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:23,576 INFO L124 PetriNetUnfolderBase]: 2577/3795 cut-off events. [2024-06-20 18:56:23,576 INFO L125 PetriNetUnfolderBase]: For 130451/130457 co-relation queries the response was YES. [2024-06-20 18:56:23,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29157 conditions, 3795 events. 2577/3795 cut-off events. For 130451/130457 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17785 event pairs, 637 based on Foata normal form. 16/3811 useless extension candidates. Maximal degree in co-relation 29093. Up to 2800 conditions per place. [2024-06-20 18:56:23,605 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 133 selfloop transitions, 99 changer transitions 0/235 dead transitions. [2024-06-20 18:56:23,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 235 transitions, 3911 flow [2024-06-20 18:56:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:56:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:56:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 18:56:23,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:56:23,607 INFO L175 Difference]: Start difference. First operand has 143 places, 194 transitions, 2883 flow. Second operand 8 states and 152 transitions. [2024-06-20 18:56:23,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 235 transitions, 3911 flow [2024-06-20 18:56:23,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 235 transitions, 3585 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-20 18:56:23,736 INFO L231 Difference]: Finished difference. Result has 144 places, 201 transitions, 2977 flow [2024-06-20 18:56:23,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2977, PETRI_PLACES=144, PETRI_TRANSITIONS=201} [2024-06-20 18:56:23,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-20 18:56:23,737 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 201 transitions, 2977 flow [2024-06-20 18:56:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:23,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:23,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:23,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 18:56:23,737 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:56:23,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2006519113, now seen corresponding path program 6 times [2024-06-20 18:56:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017969043] [2024-06-20 18:56:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:31,043 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 18:56:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017969043] [2024-06-20 18:56:31,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017969043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:56:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161553950] [2024-06-20 18:56:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:31,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:56:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:56:31,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:56:31,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:56:31,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 201 transitions, 2977 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:31,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:31,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:56:31,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:32,518 INFO L124 PetriNetUnfolderBase]: 2575/3791 cut-off events. [2024-06-20 18:56:32,518 INFO L125 PetriNetUnfolderBase]: For 132878/132884 co-relation queries the response was YES. [2024-06-20 18:56:32,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29189 conditions, 3791 events. 2575/3791 cut-off events. For 132878/132884 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17750 event pairs, 629 based on Foata normal form. 10/3801 useless extension candidates. Maximal degree in co-relation 29125. Up to 2807 conditions per place. [2024-06-20 18:56:32,546 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 129 selfloop transitions, 105 changer transitions 0/237 dead transitions. [2024-06-20 18:56:32,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 237 transitions, 3866 flow [2024-06-20 18:56:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:56:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:56:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 18:56:32,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-20 18:56:32,548 INFO L175 Difference]: Start difference. First operand has 144 places, 201 transitions, 2977 flow. Second operand 8 states and 150 transitions. [2024-06-20 18:56:32,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 237 transitions, 3866 flow [2024-06-20 18:56:32,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 237 transitions, 3512 flow, removed 101 selfloop flow, removed 4 redundant places. [2024-06-20 18:56:32,677 INFO L231 Difference]: Finished difference. Result has 149 places, 205 transitions, 2945 flow [2024-06-20 18:56:32,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2640, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2945, PETRI_PLACES=149, PETRI_TRANSITIONS=205} [2024-06-20 18:56:32,678 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-20 18:56:32,678 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 205 transitions, 2945 flow [2024-06-20 18:56:32,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:56:32,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:32,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:32,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 18:56:32,679 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 18:56:32,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -530226919, now seen corresponding path program 1 times [2024-06-20 18:56:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:32,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730919316] [2024-06-20 18:56:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:56:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730919316] [2024-06-20 18:56:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730919316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:56:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492665493] [2024-06-20 18:56:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:56:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:56:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:56:45,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:56:45,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 205 transitions, 2945 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 18:56:45,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:45,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:56:45,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:46,780 INFO L124 PetriNetUnfolderBase]: 2317/3521 cut-off events. [2024-06-20 18:56:46,781 INFO L125 PetriNetUnfolderBase]: For 118016/118016 co-relation queries the response was YES. [2024-06-20 18:56:46,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26765 conditions, 3521 events. 2317/3521 cut-off events. For 118016/118016 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17098 event pairs, 556 based on Foata normal form. 2/3523 useless extension candidates. Maximal degree in co-relation 26699. Up to 3397 conditions per place. [2024-06-20 18:56:46,805 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 203 selfloop transitions, 11 changer transitions 0/218 dead transitions. [2024-06-20 18:56:46,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 218 transitions, 3425 flow [2024-06-20 18:56:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:56:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:56:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-20 18:56:46,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861788617886179 [2024-06-20 18:56:46,806 INFO L175 Difference]: Start difference. First operand has 149 places, 205 transitions, 2945 flow. Second operand 6 states and 95 transitions. [2024-06-20 18:56:46,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 218 transitions, 3425 flow [2024-06-20 18:56:46,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 218 transitions, 3246 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 18:56:46,914 INFO L231 Difference]: Finished difference. Result has 150 places, 208 transitions, 2828 flow [2024-06-20 18:56:46,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2828, PETRI_PLACES=150, PETRI_TRANSITIONS=208} [2024-06-20 18:56:46,914 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2024-06-20 18:56:46,915 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 208 transitions, 2828 flow [2024-06-20 18:56:46,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 18:56:46,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:46,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:46,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 18:56:46,915 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 18:56:46,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 949096544, now seen corresponding path program 1 times [2024-06-20 18:56:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602507480] [2024-06-20 18:56:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:56:54,493 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 18:56:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:56:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602507480] [2024-06-20 18:56:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602507480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:56:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:56:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:56:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005426580] [2024-06-20 18:56:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:56:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:56:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:56:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:56:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:56:54,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:56:54,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 208 transitions, 2828 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:56:54,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:56:54,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:56:54,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:56:56,198 INFO L124 PetriNetUnfolderBase]: 2469/3686 cut-off events. [2024-06-20 18:56:56,198 INFO L125 PetriNetUnfolderBase]: For 140829/140835 co-relation queries the response was YES. [2024-06-20 18:56:56,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28463 conditions, 3686 events. 2469/3686 cut-off events. For 140829/140835 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17736 event pairs, 442 based on Foata normal form. 10/3696 useless extension candidates. Maximal degree in co-relation 28396. Up to 3327 conditions per place. [2024-06-20 18:56:56,224 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 184 selfloop transitions, 17 changer transitions 0/241 dead transitions. [2024-06-20 18:56:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 241 transitions, 3372 flow [2024-06-20 18:56:56,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:56:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:56:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-20 18:56:56,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-20 18:56:56,225 INFO L175 Difference]: Start difference. First operand has 150 places, 208 transitions, 2828 flow. Second operand 8 states and 138 transitions. [2024-06-20 18:56:56,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 241 transitions, 3372 flow [2024-06-20 18:56:56,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 241 transitions, 3332 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 18:56:56,340 INFO L231 Difference]: Finished difference. Result has 154 places, 210 transitions, 2897 flow [2024-06-20 18:56:56,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2788, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2897, PETRI_PLACES=154, PETRI_TRANSITIONS=210} [2024-06-20 18:56:56,341 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-20 18:56:56,341 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 210 transitions, 2897 flow [2024-06-20 18:56:56,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:56:56,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:56,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:56:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 18:56:56,341 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 18:56:56,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 338529798, now seen corresponding path program 1 times [2024-06-20 18:56:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010876593] [2024-06-20 18:56:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:04,154 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 18:57:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010876593] [2024-06-20 18:57:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010876593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583042650] [2024-06-20 18:57:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:04,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:04,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:57:04,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 210 transitions, 2897 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:57:04,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:04,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:57:04,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:05,856 INFO L124 PetriNetUnfolderBase]: 2574/3788 cut-off events. [2024-06-20 18:57:05,856 INFO L125 PetriNetUnfolderBase]: For 147394/147394 co-relation queries the response was YES. [2024-06-20 18:57:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29369 conditions, 3788 events. 2574/3788 cut-off events. For 147394/147394 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17729 event pairs, 580 based on Foata normal form. 3/3791 useless extension candidates. Maximal degree in co-relation 29301. Up to 3598 conditions per place. [2024-06-20 18:57:05,889 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 201 selfloop transitions, 40 changer transitions 0/244 dead transitions. [2024-06-20 18:57:05,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 244 transitions, 3647 flow [2024-06-20 18:57:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:57:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:57:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-20 18:57:05,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-20 18:57:05,890 INFO L175 Difference]: Start difference. First operand has 154 places, 210 transitions, 2897 flow. Second operand 8 states and 142 transitions. [2024-06-20 18:57:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 244 transitions, 3647 flow [2024-06-20 18:57:06,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 244 transitions, 3518 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-20 18:57:06,020 INFO L231 Difference]: Finished difference. Result has 156 places, 210 transitions, 2864 flow [2024-06-20 18:57:06,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2768, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2864, PETRI_PLACES=156, PETRI_TRANSITIONS=210} [2024-06-20 18:57:06,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-20 18:57:06,021 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 210 transitions, 2864 flow [2024-06-20 18:57:06,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:57:06,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:06,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:06,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 18:57:06,021 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 18:57:06,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 338529674, now seen corresponding path program 2 times [2024-06-20 18:57:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190430803] [2024-06-20 18:57:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:13,803 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 18:57:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190430803] [2024-06-20 18:57:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190430803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710670601] [2024-06-20 18:57:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:13,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:13,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:57:13,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 210 transitions, 2864 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:13,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:13,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:57:13,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:15,433 INFO L124 PetriNetUnfolderBase]: 2546/3808 cut-off events. [2024-06-20 18:57:15,433 INFO L125 PetriNetUnfolderBase]: For 160920/160930 co-relation queries the response was YES. [2024-06-20 18:57:15,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29982 conditions, 3808 events. 2546/3808 cut-off events. For 160920/160930 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18374 event pairs, 563 based on Foata normal form. 14/3822 useless extension candidates. Maximal degree in co-relation 29913. Up to 3419 conditions per place. [2024-06-20 18:57:15,464 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 188 selfloop transitions, 30 changer transitions 0/258 dead transitions. [2024-06-20 18:57:15,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 258 transitions, 3739 flow [2024-06-20 18:57:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:57:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:57:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-20 18:57:15,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-20 18:57:15,465 INFO L175 Difference]: Start difference. First operand has 156 places, 210 transitions, 2864 flow. Second operand 9 states and 150 transitions. [2024-06-20 18:57:15,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 258 transitions, 3739 flow [2024-06-20 18:57:15,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 258 transitions, 3614 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 18:57:15,623 INFO L231 Difference]: Finished difference. Result has 162 places, 229 transitions, 3193 flow [2024-06-20 18:57:15,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2756, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3193, PETRI_PLACES=162, PETRI_TRANSITIONS=229} [2024-06-20 18:57:15,624 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-20 18:57:15,624 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 229 transitions, 3193 flow [2024-06-20 18:57:15,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:15,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:15,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:15,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 18:57:15,625 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 18:57:15,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1631735840, now seen corresponding path program 3 times [2024-06-20 18:57:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684815689] [2024-06-20 18:57:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:23,360 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 18:57:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684815689] [2024-06-20 18:57:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684815689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319611220] [2024-06-20 18:57:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:23,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:23,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:57:23,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 229 transitions, 3193 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:23,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:23,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:57:23,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:25,103 INFO L124 PetriNetUnfolderBase]: 2666/3988 cut-off events. [2024-06-20 18:57:25,103 INFO L125 PetriNetUnfolderBase]: For 175783/175803 co-relation queries the response was YES. [2024-06-20 18:57:25,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31958 conditions, 3988 events. 2666/3988 cut-off events. For 175783/175803 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19413 event pairs, 560 based on Foata normal form. 24/4012 useless extension candidates. Maximal degree in co-relation 31886. Up to 3546 conditions per place. [2024-06-20 18:57:25,136 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 200 selfloop transitions, 51 changer transitions 0/291 dead transitions. [2024-06-20 18:57:25,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 291 transitions, 4372 flow [2024-06-20 18:57:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:57:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:57:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-20 18:57:25,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-20 18:57:25,139 INFO L175 Difference]: Start difference. First operand has 162 places, 229 transitions, 3193 flow. Second operand 9 states and 156 transitions. [2024-06-20 18:57:25,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 291 transitions, 4372 flow [2024-06-20 18:57:25,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 291 transitions, 4206 flow, removed 64 selfloop flow, removed 2 redundant places. [2024-06-20 18:57:25,321 INFO L231 Difference]: Finished difference. Result has 171 places, 257 transitions, 3785 flow [2024-06-20 18:57:25,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3785, PETRI_PLACES=171, PETRI_TRANSITIONS=257} [2024-06-20 18:57:25,322 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-20 18:57:25,322 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 257 transitions, 3785 flow [2024-06-20 18:57:25,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:25,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:25,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:25,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 18:57:25,323 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 18:57:25,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 115497566, now seen corresponding path program 4 times [2024-06-20 18:57:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805477894] [2024-06-20 18:57:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:33,355 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 18:57:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:33,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805477894] [2024-06-20 18:57:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805477894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414640985] [2024-06-20 18:57:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:33,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:33,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:57:33,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 257 transitions, 3785 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:33,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:33,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:57:33,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:35,074 INFO L124 PetriNetUnfolderBase]: 2782/4162 cut-off events. [2024-06-20 18:57:35,074 INFO L125 PetriNetUnfolderBase]: For 191070/191084 co-relation queries the response was YES. [2024-06-20 18:57:35,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34001 conditions, 4162 events. 2782/4162 cut-off events. For 191070/191084 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20408 event pairs, 563 based on Foata normal form. 18/4180 useless extension candidates. Maximal degree in co-relation 33925. Up to 3670 conditions per place. [2024-06-20 18:57:35,113 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 211 selfloop transitions, 73 changer transitions 0/324 dead transitions. [2024-06-20 18:57:35,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 324 transitions, 5190 flow [2024-06-20 18:57:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:57:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:57:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-20 18:57:35,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-20 18:57:35,116 INFO L175 Difference]: Start difference. First operand has 171 places, 257 transitions, 3785 flow. Second operand 9 states and 157 transitions. [2024-06-20 18:57:35,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 324 transitions, 5190 flow [2024-06-20 18:57:35,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 324 transitions, 4956 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-06-20 18:57:35,346 INFO L231 Difference]: Finished difference. Result has 178 places, 292 transitions, 4548 flow [2024-06-20 18:57:35,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3647, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4548, PETRI_PLACES=178, PETRI_TRANSITIONS=292} [2024-06-20 18:57:35,346 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-20 18:57:35,346 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 292 transitions, 4548 flow [2024-06-20 18:57:35,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:35,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:35,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:35,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 18:57:35,347 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 18:57:35,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 231986006, now seen corresponding path program 1 times [2024-06-20 18:57:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:35,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142449078] [2024-06-20 18:57:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:44,301 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 18:57:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142449078] [2024-06-20 18:57:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142449078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:44,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689860925] [2024-06-20 18:57:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:44,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:57:44,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 292 transitions, 4548 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:57:44,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:44,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:57:44,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:46,152 INFO L124 PetriNetUnfolderBase]: 2995/4426 cut-off events. [2024-06-20 18:57:46,153 INFO L125 PetriNetUnfolderBase]: For 208060/208064 co-relation queries the response was YES. [2024-06-20 18:57:46,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36428 conditions, 4426 events. 2995/4426 cut-off events. For 208060/208064 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21503 event pairs, 878 based on Foata normal form. 10/4436 useless extension candidates. Maximal degree in co-relation 36348. Up to 4287 conditions per place. [2024-06-20 18:57:46,191 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 306 selfloop transitions, 40 changer transitions 0/349 dead transitions. [2024-06-20 18:57:46,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 349 transitions, 5900 flow [2024-06-20 18:57:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:57:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:57:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-20 18:57:46,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4073170731707317 [2024-06-20 18:57:46,193 INFO L175 Difference]: Start difference. First operand has 178 places, 292 transitions, 4548 flow. Second operand 10 states and 167 transitions. [2024-06-20 18:57:46,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 349 transitions, 5900 flow [2024-06-20 18:57:46,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 349 transitions, 5729 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-20 18:57:46,411 INFO L231 Difference]: Finished difference. Result has 187 places, 312 transitions, 4855 flow [2024-06-20 18:57:46,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4377, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4855, PETRI_PLACES=187, PETRI_TRANSITIONS=312} [2024-06-20 18:57:46,412 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-20 18:57:46,412 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 312 transitions, 4855 flow [2024-06-20 18:57:46,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:57:46,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:46,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 18:57:46,413 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 18:57:46,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash 231801308, now seen corresponding path program 5 times [2024-06-20 18:57:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613807657] [2024-06-20 18:57:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:53,567 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 18:57:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613807657] [2024-06-20 18:57:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613807657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:57:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638882358] [2024-06-20 18:57:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:53,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:57:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:57:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:57:53,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:57:53,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 312 transitions, 4855 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:53,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:53,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:57:53,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:55,343 INFO L124 PetriNetUnfolderBase]: 2917/4365 cut-off events. [2024-06-20 18:57:55,343 INFO L125 PetriNetUnfolderBase]: For 215847/215857 co-relation queries the response was YES. [2024-06-20 18:57:55,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36570 conditions, 4365 events. 2917/4365 cut-off events. For 215847/215857 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21606 event pairs, 548 based on Foata normal form. 14/4379 useless extension candidates. Maximal degree in co-relation 36486. Up to 3812 conditions per place. [2024-06-20 18:57:55,383 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 220 selfloop transitions, 85 changer transitions 0/350 dead transitions. [2024-06-20 18:57:55,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 350 transitions, 5707 flow [2024-06-20 18:57:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:57:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:57:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-20 18:57:55,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-20 18:57:55,386 INFO L175 Difference]: Start difference. First operand has 187 places, 312 transitions, 4855 flow. Second operand 9 states and 157 transitions. [2024-06-20 18:57:55,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 350 transitions, 5707 flow [2024-06-20 18:57:55,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 350 transitions, 5552 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-20 18:57:55,676 INFO L231 Difference]: Finished difference. Result has 193 places, 318 transitions, 5068 flow [2024-06-20 18:57:55,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5068, PETRI_PLACES=193, PETRI_TRANSITIONS=318} [2024-06-20 18:57:55,677 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-20 18:57:55,677 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 318 transitions, 5068 flow [2024-06-20 18:57:55,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:57:55,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:55,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:55,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 18:57:55,678 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:57:55,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -266626524, now seen corresponding path program 1 times [2024-06-20 18:57:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:55,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224588064] [2024-06-20 18:57:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:58:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:06,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224588064] [2024-06-20 18:58:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224588064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:06,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089094979] [2024-06-20 18:58:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:06,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:07,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:58:07,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 318 transitions, 5068 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:58:07,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:07,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:58:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:08,673 INFO L124 PetriNetUnfolderBase]: 3031/4481 cut-off events. [2024-06-20 18:58:08,673 INFO L125 PetriNetUnfolderBase]: For 227917/227921 co-relation queries the response was YES. [2024-06-20 18:58:08,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37766 conditions, 4481 events. 3031/4481 cut-off events. For 227917/227921 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21806 event pairs, 885 based on Foata normal form. 5/4486 useless extension candidates. Maximal degree in co-relation 37680. Up to 4418 conditions per place. [2024-06-20 18:58:08,710 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 308 selfloop transitions, 25 changer transitions 0/336 dead transitions. [2024-06-20 18:58:08,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 336 transitions, 5862 flow [2024-06-20 18:58:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:58:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:58:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 18:58:08,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-20 18:58:08,711 INFO L175 Difference]: Start difference. First operand has 193 places, 318 transitions, 5068 flow. Second operand 7 states and 113 transitions. [2024-06-20 18:58:08,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 336 transitions, 5862 flow [2024-06-20 18:58:08,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 336 transitions, 5668 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-20 18:58:08,961 INFO L231 Difference]: Finished difference. Result has 196 places, 318 transitions, 4931 flow [2024-06-20 18:58:08,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4874, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4931, PETRI_PLACES=196, PETRI_TRANSITIONS=318} [2024-06-20 18:58:08,962 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-20 18:58:08,962 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 318 transitions, 4931 flow [2024-06-20 18:58:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:58:08,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:08,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 18:58:08,963 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 18:58:08,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1320551772, now seen corresponding path program 6 times [2024-06-20 18:58:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347435931] [2024-06-20 18:58:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:17,390 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 18:58:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347435931] [2024-06-20 18:58:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347435931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:58:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387484508] [2024-06-20 18:58:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:58:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:58:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:58:17,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:58:17,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 318 transitions, 4931 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:58:17,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:17,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:58:17,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:19,258 INFO L124 PetriNetUnfolderBase]: 2931/4388 cut-off events. [2024-06-20 18:58:19,258 INFO L125 PetriNetUnfolderBase]: For 236580/236590 co-relation queries the response was YES. [2024-06-20 18:58:19,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37143 conditions, 4388 events. 2931/4388 cut-off events. For 236580/236590 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21768 event pairs, 556 based on Foata normal form. 14/4402 useless extension candidates. Maximal degree in co-relation 37056. Up to 3764 conditions per place. [2024-06-20 18:58:19,299 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 95 changer transitions 0/347 dead transitions. [2024-06-20 18:58:19,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 347 transitions, 5713 flow [2024-06-20 18:58:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 18:58:19,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-20 18:58:19,302 INFO L175 Difference]: Start difference. First operand has 196 places, 318 transitions, 4931 flow. Second operand 8 states and 139 transitions. [2024-06-20 18:58:19,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 347 transitions, 5713 flow [2024-06-20 18:58:19,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 347 transitions, 5663 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 18:58:19,565 INFO L231 Difference]: Finished difference. Result has 199 places, 320 transitions, 5171 flow [2024-06-20 18:58:19,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4881, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5171, PETRI_PLACES=199, PETRI_TRANSITIONS=320} [2024-06-20 18:58:19,566 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-20 18:58:19,566 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 320 transitions, 5171 flow [2024-06-20 18:58:19,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:58:19,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:19,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:19,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 18:58:19,566 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 18:58:19,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1067429372, now seen corresponding path program 2 times [2024-06-20 18:58:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317318679] [2024-06-20 18:58:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:27,699 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 18:58:27,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317318679] [2024-06-20 18:58:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317318679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:58:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077533270] [2024-06-20 18:58:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:27,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:58:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:58:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:58:27,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:58:27,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 320 transitions, 5171 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:58:27,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:27,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:58:27,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:29,686 INFO L124 PetriNetUnfolderBase]: 3200/4754 cut-off events. [2024-06-20 18:58:29,686 INFO L125 PetriNetUnfolderBase]: For 284122/284126 co-relation queries the response was YES. [2024-06-20 18:58:29,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40410 conditions, 4754 events. 3200/4754 cut-off events. For 284122/284126 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 23627 event pairs, 604 based on Foata normal form. 40/4794 useless extension candidates. Maximal degree in co-relation 40322. Up to 3715 conditions per place. [2024-06-20 18:58:29,729 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 234 selfloop transitions, 124 changer transitions 0/361 dead transitions. [2024-06-20 18:58:29,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 361 transitions, 6271 flow [2024-06-20 18:58:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:58:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:58:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-20 18:58:29,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:58:29,731 INFO L175 Difference]: Start difference. First operand has 199 places, 320 transitions, 5171 flow. Second operand 9 states and 162 transitions. [2024-06-20 18:58:29,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 361 transitions, 6271 flow [2024-06-20 18:58:30,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 361 transitions, 5995 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-20 18:58:30,043 INFO L231 Difference]: Finished difference. Result has 202 places, 323 transitions, 5258 flow [2024-06-20 18:58:30,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4901, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5258, PETRI_PLACES=202, PETRI_TRANSITIONS=323} [2024-06-20 18:58:30,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-20 18:58:30,044 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 323 transitions, 5258 flow [2024-06-20 18:58:30,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:58:30,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:30,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:30,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 18:58:30,044 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:58:30,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -127479834, now seen corresponding path program 2 times [2024-06-20 18:58:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810376053] [2024-06-20 18:58:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:42,524 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 18:58:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810376053] [2024-06-20 18:58:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810376053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:42,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769579573] [2024-06-20 18:58:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:42,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:58:42,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 323 transitions, 5258 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:58:42,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:42,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:58:42,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:44,295 INFO L124 PetriNetUnfolderBase]: 3205/4763 cut-off events. [2024-06-20 18:58:44,295 INFO L125 PetriNetUnfolderBase]: For 258563/258567 co-relation queries the response was YES. [2024-06-20 18:58:44,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40741 conditions, 4763 events. 3205/4763 cut-off events. For 258563/258567 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 23767 event pairs, 945 based on Foata normal form. 5/4768 useless extension candidates. Maximal degree in co-relation 40652. Up to 4699 conditions per place. [2024-06-20 18:58:44,341 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 310 selfloop transitions, 27 changer transitions 0/340 dead transitions. [2024-06-20 18:58:44,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 340 transitions, 6108 flow [2024-06-20 18:58:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:58:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:58:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-20 18:58:44,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-20 18:58:44,343 INFO L175 Difference]: Start difference. First operand has 202 places, 323 transitions, 5258 flow. Second operand 6 states and 98 transitions. [2024-06-20 18:58:44,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 340 transitions, 6108 flow [2024-06-20 18:58:44,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 340 transitions, 5793 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-20 18:58:44,651 INFO L231 Difference]: Finished difference. Result has 201 places, 326 transitions, 5066 flow [2024-06-20 18:58:44,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4949, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5066, PETRI_PLACES=201, PETRI_TRANSITIONS=326} [2024-06-20 18:58:44,651 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-20 18:58:44,651 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 326 transitions, 5066 flow [2024-06-20 18:58:44,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:58:44,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:44,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:44,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 18:58:44,652 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 18:58:44,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2072731130, now seen corresponding path program 3 times [2024-06-20 18:58:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563012090] [2024-06-20 18:58:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:53,154 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 18:58:53,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:53,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563012090] [2024-06-20 18:58:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563012090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:53,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:53,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:58:53,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166308054] [2024-06-20 18:58:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:53,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:58:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:58:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:58:53,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:58:53,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 326 transitions, 5066 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:58:53,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:53,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:58:53,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:55,177 INFO L124 PetriNetUnfolderBase]: 3357/5012 cut-off events. [2024-06-20 18:58:55,177 INFO L125 PetriNetUnfolderBase]: For 278642/278646 co-relation queries the response was YES. [2024-06-20 18:58:55,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40926 conditions, 5012 events. 3357/5012 cut-off events. For 278642/278646 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25322 event pairs, 608 based on Foata normal form. 40/5052 useless extension candidates. Maximal degree in co-relation 40836. Up to 3805 conditions per place. [2024-06-20 18:58:55,227 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 242 selfloop transitions, 122 changer transitions 0/367 dead transitions. [2024-06-20 18:58:55,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 367 transitions, 6252 flow [2024-06-20 18:58:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:58:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:58:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-20 18:58:55,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-20 18:58:55,228 INFO L175 Difference]: Start difference. First operand has 201 places, 326 transitions, 5066 flow. Second operand 9 states and 165 transitions. [2024-06-20 18:58:55,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 367 transitions, 6252 flow [2024-06-20 18:58:55,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 367 transitions, 6194 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 18:58:55,569 INFO L231 Difference]: Finished difference. Result has 206 places, 329 transitions, 5363 flow [2024-06-20 18:58:55,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5363, PETRI_PLACES=206, PETRI_TRANSITIONS=329} [2024-06-20 18:58:55,570 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-20 18:58:55,570 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 329 transitions, 5363 flow [2024-06-20 18:58:55,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:58:55,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:55,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:55,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 18:58:55,571 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:58:55,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2072546432, now seen corresponding path program 7 times [2024-06-20 18:58:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717775338] [2024-06-20 18:58:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:03,751 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 18:59:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717775338] [2024-06-20 18:59:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717775338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:59:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027013734] [2024-06-20 18:59:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:59:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:59:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:59:03,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 18:59:03,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 329 transitions, 5363 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:59:03,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:03,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 18:59:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:05,622 INFO L124 PetriNetUnfolderBase]: 3196/4846 cut-off events. [2024-06-20 18:59:05,622 INFO L125 PetriNetUnfolderBase]: For 260126/260136 co-relation queries the response was YES. [2024-06-20 18:59:05,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40482 conditions, 4846 events. 3196/4846 cut-off events. For 260126/260136 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 25125 event pairs, 607 based on Foata normal form. 14/4860 useless extension candidates. Maximal degree in co-relation 40392. Up to 4163 conditions per place. [2024-06-20 18:59:05,672 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 210 selfloop transitions, 98 changer transitions 0/356 dead transitions. [2024-06-20 18:59:05,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 356 transitions, 6153 flow [2024-06-20 18:59:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:59:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:59:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-20 18:59:05,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-20 18:59:05,675 INFO L175 Difference]: Start difference. First operand has 206 places, 329 transitions, 5363 flow. Second operand 8 states and 138 transitions. [2024-06-20 18:59:05,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 356 transitions, 6153 flow [2024-06-20 18:59:06,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 356 transitions, 5848 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-20 18:59:06,012 INFO L231 Difference]: Finished difference. Result has 207 places, 331 transitions, 5353 flow [2024-06-20 18:59:06,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5058, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5353, PETRI_PLACES=207, PETRI_TRANSITIONS=331} [2024-06-20 18:59:06,012 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-20 18:59:06,013 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 331 transitions, 5353 flow [2024-06-20 18:59:06,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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 18:59:06,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:06,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:06,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 18:59:06,013 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:06,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -279970598, now seen corresponding path program 4 times [2024-06-20 18:59:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478608183] [2024-06-20 18:59:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:14,533 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 18:59:14,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478608183] [2024-06-20 18:59:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478608183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:14,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:14,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:59:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657987204] [2024-06-20 18:59:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:59:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:59:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:59:14,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:59:14,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 331 transitions, 5353 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:14,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:14,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:59:14,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:16,701 INFO L124 PetriNetUnfolderBase]: 3501/5248 cut-off events. [2024-06-20 18:59:16,701 INFO L125 PetriNetUnfolderBase]: For 296324/296328 co-relation queries the response was YES. [2024-06-20 18:59:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42750 conditions, 5248 events. 3501/5248 cut-off events. For 296324/296328 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26974 event pairs, 606 based on Foata normal form. 40/5288 useless extension candidates. Maximal degree in co-relation 42659. Up to 4057 conditions per place. [2024-06-20 18:59:16,748 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 216 selfloop transitions, 152 changer transitions 0/371 dead transitions. [2024-06-20 18:59:16,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 371 transitions, 6481 flow [2024-06-20 18:59:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:59:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:59:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 18:59:16,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 18:59:16,750 INFO L175 Difference]: Start difference. First operand has 207 places, 331 transitions, 5353 flow. Second operand 9 states and 164 transitions. [2024-06-20 18:59:16,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 371 transitions, 6481 flow [2024-06-20 18:59:17,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 371 transitions, 6204 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-20 18:59:17,042 INFO L231 Difference]: Finished difference. Result has 210 places, 334 transitions, 5493 flow [2024-06-20 18:59:17,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5076, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5493, PETRI_PLACES=210, PETRI_TRANSITIONS=334} [2024-06-20 18:59:17,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2024-06-20 18:59:17,043 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 334 transitions, 5493 flow [2024-06-20 18:59:17,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:17,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:17,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 18:59:17,043 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:17,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1985764136, now seen corresponding path program 5 times [2024-06-20 18:59:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518096626] [2024-06-20 18:59:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:26,012 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 18:59:26,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:26,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518096626] [2024-06-20 18:59:26,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518096626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:26,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:26,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:59:26,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965464926] [2024-06-20 18:59:26,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:26,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:59:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:59:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:59:26,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:59:26,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 334 transitions, 5493 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:26,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:26,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:59:26,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:28,159 INFO L124 PetriNetUnfolderBase]: 3542/5316 cut-off events. [2024-06-20 18:59:28,160 INFO L125 PetriNetUnfolderBase]: For 292466/292474 co-relation queries the response was YES. [2024-06-20 18:59:28,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44226 conditions, 5316 events. 3542/5316 cut-off events. For 292466/292474 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 27644 event pairs, 945 based on Foata normal form. 14/5330 useless extension candidates. Maximal degree in co-relation 44134. Up to 4817 conditions per place. [2024-06-20 18:59:28,211 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 278 selfloop transitions, 106 changer transitions 0/387 dead transitions. [2024-06-20 18:59:28,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 387 transitions, 7130 flow [2024-06-20 18:59:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:59:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:59:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-20 18:59:28,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-20 18:59:28,212 INFO L175 Difference]: Start difference. First operand has 210 places, 334 transitions, 5493 flow. Second operand 9 states and 154 transitions. [2024-06-20 18:59:28,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 387 transitions, 7130 flow [2024-06-20 18:59:28,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 387 transitions, 6694 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-20 18:59:28,649 INFO L231 Difference]: Finished difference. Result has 214 places, 355 transitions, 5818 flow [2024-06-20 18:59:28,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5120, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5818, PETRI_PLACES=214, PETRI_TRANSITIONS=355} [2024-06-20 18:59:28,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2024-06-20 18:59:28,651 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 355 transitions, 5818 flow [2024-06-20 18:59:28,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:28,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:28,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:28,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 18:59:28,651 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:28,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1986060806, now seen corresponding path program 6 times [2024-06-20 18:59:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674847035] [2024-06-20 18:59:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:37,845 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 18:59:37,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:37,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674847035] [2024-06-20 18:59:37,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674847035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:37,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:37,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:59:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514714055] [2024-06-20 18:59:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:37,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:59:37,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:59:37,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:59:38,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:59:38,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 355 transitions, 5818 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:38,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:38,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:59:38,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:40,072 INFO L124 PetriNetUnfolderBase]: 3532/5302 cut-off events. [2024-06-20 18:59:40,072 INFO L125 PetriNetUnfolderBase]: For 286831/286839 co-relation queries the response was YES. [2024-06-20 18:59:40,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43660 conditions, 5302 events. 3532/5302 cut-off events. For 286831/286839 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27550 event pairs, 1001 based on Foata normal form. 14/5316 useless extension candidates. Maximal degree in co-relation 43565. Up to 4949 conditions per place. [2024-06-20 18:59:40,118 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 292 selfloop transitions, 93 changer transitions 0/388 dead transitions. [2024-06-20 18:59:40,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 388 transitions, 6862 flow [2024-06-20 18:59:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:59:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:59:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-20 18:59:40,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-20 18:59:40,121 INFO L175 Difference]: Start difference. First operand has 214 places, 355 transitions, 5818 flow. Second operand 10 states and 166 transitions. [2024-06-20 18:59:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 388 transitions, 6862 flow [2024-06-20 18:59:40,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 388 transitions, 6540 flow, removed 119 selfloop flow, removed 4 redundant places. [2024-06-20 18:59:40,532 INFO L231 Difference]: Finished difference. Result has 220 places, 355 transitions, 5694 flow [2024-06-20 18:59:40,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5496, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5694, PETRI_PLACES=220, PETRI_TRANSITIONS=355} [2024-06-20 18:59:40,533 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places. [2024-06-20 18:59:40,533 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 355 transitions, 5694 flow [2024-06-20 18:59:40,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 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 18:59:40,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:40,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:40,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 18:59:40,534 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:40,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 742822536, now seen corresponding path program 3 times [2024-06-20 18:59:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517365383] [2024-06-20 18:59:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:52,443 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 18:59:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517365383] [2024-06-20 18:59:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517365383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:59:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762340699] [2024-06-20 18:59:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:52,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:59:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:59:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:59:52,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 18:59:52,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 355 transitions, 5694 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:59:52,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:52,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 18:59:52,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:54,314 INFO L124 PetriNetUnfolderBase]: 3529/5293 cut-off events. [2024-06-20 18:59:54,314 INFO L125 PetriNetUnfolderBase]: For 287198/287206 co-relation queries the response was YES. [2024-06-20 18:59:54,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43477 conditions, 5293 events. 3529/5293 cut-off events. For 287198/287206 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27406 event pairs, 1017 based on Foata normal form. 9/5302 useless extension candidates. Maximal degree in co-relation 43380. Up to 5229 conditions per place. [2024-06-20 18:59:54,373 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 334 selfloop transitions, 26 changer transitions 0/363 dead transitions. [2024-06-20 18:59:54,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 363 transitions, 6438 flow [2024-06-20 18:59:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:59:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:59:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-20 18:59:54,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-20 18:59:54,374 INFO L175 Difference]: Start difference. First operand has 220 places, 355 transitions, 5694 flow. Second operand 6 states and 91 transitions. [2024-06-20 18:59:54,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 363 transitions, 6438 flow [2024-06-20 18:59:54,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 363 transitions, 6234 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 18:59:54,734 INFO L231 Difference]: Finished difference. Result has 219 places, 355 transitions, 5548 flow [2024-06-20 18:59:54,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5548, PETRI_PLACES=219, PETRI_TRANSITIONS=355} [2024-06-20 18:59:54,735 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-20 18:59:54,735 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 355 transitions, 5548 flow [2024-06-20 18:59:54,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 18:59:54,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:54,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:54,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 18:59:54,735 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:54,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1235411028, now seen corresponding path program 1 times [2024-06-20 18:59:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426072489] [2024-06-20 18:59:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:04,599 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:00:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:04,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426072489] [2024-06-20 19:00:04,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426072489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:04,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:00:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358041915] [2024-06-20 19:00:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:04,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:00:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:04,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:00:04,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:00:04,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 19:00:04,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 355 transitions, 5548 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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 19:00:04,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:04,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 19:00:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:06,324 INFO L124 PetriNetUnfolderBase]: 3282/5050 cut-off events. [2024-06-20 19:00:06,324 INFO L125 PetriNetUnfolderBase]: For 258675/258675 co-relation queries the response was YES. [2024-06-20 19:00:06,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40206 conditions, 5050 events. 3282/5050 cut-off events. For 258675/258675 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 27036 event pairs, 1068 based on Foata normal form. 2/5052 useless extension candidates. Maximal degree in co-relation 40108. Up to 4875 conditions per place. [2024-06-20 19:00:06,384 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 346 selfloop transitions, 20 changer transitions 0/370 dead transitions. [2024-06-20 19:00:06,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 370 transitions, 6450 flow [2024-06-20 19:00:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:00:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:00:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-20 19:00:06,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-20 19:00:06,385 INFO L175 Difference]: Start difference. First operand has 219 places, 355 transitions, 5548 flow. Second operand 6 states and 102 transitions. [2024-06-20 19:00:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 370 transitions, 6450 flow [2024-06-20 19:00:06,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 370 transitions, 6382 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 19:00:06,750 INFO L231 Difference]: Finished difference. Result has 220 places, 358 transitions, 5576 flow [2024-06-20 19:00:06,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5480, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5576, PETRI_PLACES=220, PETRI_TRANSITIONS=358} [2024-06-20 19:00:06,751 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places. [2024-06-20 19:00:06,751 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 358 transitions, 5576 flow [2024-06-20 19:00:06,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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 19:00:06,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:06,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:00:06,751 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:00:06,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 742828488, now seen corresponding path program 2 times [2024-06-20 19:00:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84709137] [2024-06-20 19:00:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:16,436 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:00:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84709137] [2024-06-20 19:00:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84709137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:00:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035182307] [2024-06-20 19:00:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:16,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:00:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:00:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:00:16,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 19:00:16,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 358 transitions, 5576 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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 19:00:16,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:16,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 19:00:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:18,145 INFO L124 PetriNetUnfolderBase]: 3232/4968 cut-off events. [2024-06-20 19:00:18,146 INFO L125 PetriNetUnfolderBase]: For 264349/264349 co-relation queries the response was YES. [2024-06-20 19:00:18,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39876 conditions, 4968 events. 3232/4968 cut-off events. For 264349/264349 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 26498 event pairs, 1061 based on Foata normal form. 1/4969 useless extension candidates. Maximal degree in co-relation 39777. Up to 4826 conditions per place. [2024-06-20 19:00:18,204 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 350 selfloop transitions, 12 changer transitions 0/366 dead transitions. [2024-06-20 19:00:18,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 366 transitions, 6324 flow [2024-06-20 19:00:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:00:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:00:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-20 19:00:18,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-20 19:00:18,205 INFO L175 Difference]: Start difference. First operand has 220 places, 358 transitions, 5576 flow. Second operand 6 states and 94 transitions. [2024-06-20 19:00:18,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 366 transitions, 6324 flow [2024-06-20 19:00:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 366 transitions, 6293 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:00:18,554 INFO L231 Difference]: Finished difference. Result has 223 places, 358 transitions, 5575 flow [2024-06-20 19:00:18,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5545, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5575, PETRI_PLACES=223, PETRI_TRANSITIONS=358} [2024-06-20 19:00:18,555 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2024-06-20 19:00:18,555 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 358 transitions, 5575 flow [2024-06-20 19:00:18,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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 19:00:18,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:18,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:18,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:00:18,555 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 19:00:18,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1266544496, now seen corresponding path program 1 times [2024-06-20 19:00:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900649725] [2024-06-20 19:00:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:27,480 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:00:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900649725] [2024-06-20 19:00:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900649725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:00:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142380231] [2024-06-20 19:00:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:00:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:00:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:00:27,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:00:27,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 358 transitions, 5575 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:27,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:27,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:00:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:29,656 INFO L124 PetriNetUnfolderBase]: 3599/5405 cut-off events. [2024-06-20 19:00:29,657 INFO L125 PetriNetUnfolderBase]: For 333016/333024 co-relation queries the response was YES. [2024-06-20 19:00:29,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44833 conditions, 5405 events. 3599/5405 cut-off events. For 333016/333024 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28326 event pairs, 914 based on Foata normal form. 14/5419 useless extension candidates. Maximal degree in co-relation 44733. Up to 5069 conditions per place. [2024-06-20 19:00:29,708 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 350 selfloop transitions, 66 changer transitions 0/419 dead transitions. [2024-06-20 19:00:29,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 419 transitions, 7240 flow [2024-06-20 19:00:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:00:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:00:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-20 19:00:29,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-20 19:00:29,709 INFO L175 Difference]: Start difference. First operand has 223 places, 358 transitions, 5575 flow. Second operand 10 states and 174 transitions. [2024-06-20 19:00:29,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 419 transitions, 7240 flow [2024-06-20 19:00:30,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 419 transitions, 7191 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:30,077 INFO L231 Difference]: Finished difference. Result has 229 places, 373 transitions, 6013 flow [2024-06-20 19:00:30,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5526, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6013, PETRI_PLACES=229, PETRI_TRANSITIONS=373} [2024-06-20 19:00:30,078 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-20 19:00:30,078 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 373 transitions, 6013 flow [2024-06-20 19:00:30,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:30,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:30,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:30,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:00:30,078 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 19:00:30,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash -834782696, now seen corresponding path program 2 times [2024-06-20 19:00:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267951274] [2024-06-20 19:00:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:38,726 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:00:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267951274] [2024-06-20 19:00:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267951274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:00:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393526090] [2024-06-20 19:00:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:38,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:00:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:00:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:00:38,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:00:38,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 373 transitions, 6013 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:38,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:38,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:00:38,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:41,027 INFO L124 PetriNetUnfolderBase]: 3729/5595 cut-off events. [2024-06-20 19:00:41,027 INFO L125 PetriNetUnfolderBase]: For 351292/351296 co-relation queries the response was YES. [2024-06-20 19:00:41,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47783 conditions, 5595 events. 3729/5595 cut-off events. For 351292/351296 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 29332 event pairs, 931 based on Foata normal form. 10/5605 useless extension candidates. Maximal degree in co-relation 47680. Up to 5180 conditions per place. [2024-06-20 19:00:41,085 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 344 selfloop transitions, 87 changer transitions 0/434 dead transitions. [2024-06-20 19:00:41,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 434 transitions, 7720 flow [2024-06-20 19:00:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:00:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:00:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-20 19:00:41,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-20 19:00:41,086 INFO L175 Difference]: Start difference. First operand has 229 places, 373 transitions, 6013 flow. Second operand 10 states and 174 transitions. [2024-06-20 19:00:41,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 434 transitions, 7720 flow [2024-06-20 19:00:41,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 434 transitions, 7516 flow, removed 70 selfloop flow, removed 4 redundant places. [2024-06-20 19:00:41,678 INFO L231 Difference]: Finished difference. Result has 237 places, 392 transitions, 6500 flow [2024-06-20 19:00:41,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5809, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6500, PETRI_PLACES=237, PETRI_TRANSITIONS=392} [2024-06-20 19:00:41,678 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places. [2024-06-20 19:00:41,678 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 392 transitions, 6500 flow [2024-06-20 19:00:41,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:41,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:41,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:41,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:00:41,679 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 19:00:41,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -834411626, now seen corresponding path program 3 times [2024-06-20 19:00:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665694547] [2024-06-20 19:00:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:49,903 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:00:49,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665694547] [2024-06-20 19:00:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665694547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:00:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758241078] [2024-06-20 19:00:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:49,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:00:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:00:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:00:50,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:00:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 392 transitions, 6500 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:00:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:52,337 INFO L124 PetriNetUnfolderBase]: 3783/5671 cut-off events. [2024-06-20 19:00:52,337 INFO L125 PetriNetUnfolderBase]: For 371533/371537 co-relation queries the response was YES. [2024-06-20 19:00:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49429 conditions, 5671 events. 3783/5671 cut-off events. For 371533/371537 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 29775 event pairs, 937 based on Foata normal form. 10/5681 useless extension candidates. Maximal degree in co-relation 49322. Up to 5121 conditions per place. [2024-06-20 19:00:52,401 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 353 selfloop transitions, 85 changer transitions 0/441 dead transitions. [2024-06-20 19:00:52,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 441 transitions, 8095 flow [2024-06-20 19:00:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:00:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:00:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-20 19:00:52,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-20 19:00:52,403 INFO L175 Difference]: Start difference. First operand has 237 places, 392 transitions, 6500 flow. Second operand 10 states and 175 transitions. [2024-06-20 19:00:52,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 441 transitions, 8095 flow [2024-06-20 19:00:53,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 441 transitions, 7868 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:53,038 INFO L231 Difference]: Finished difference. Result has 242 places, 398 transitions, 6679 flow [2024-06-20 19:00:53,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6273, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6679, PETRI_PLACES=242, PETRI_TRANSITIONS=398} [2024-06-20 19:00:53,039 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places. [2024-06-20 19:00:53,039 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 398 transitions, 6679 flow [2024-06-20 19:00:53,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:00:53,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:53,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:53,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:00:53,039 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 19:00:53,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1841764798, now seen corresponding path program 4 times [2024-06-20 19:00:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556400531] [2024-06-20 19:00:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:02,058 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:01:02,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556400531] [2024-06-20 19:01:02,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556400531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:02,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:02,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:01:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572276137] [2024-06-20 19:01:02,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:02,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:01:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:02,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:01:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:01:02,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:01:02,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 398 transitions, 6679 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:02,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:02,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:01:02,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:04,468 INFO L124 PetriNetUnfolderBase]: 3968/5958 cut-off events. [2024-06-20 19:01:04,469 INFO L125 PetriNetUnfolderBase]: For 411502/411510 co-relation queries the response was YES. [2024-06-20 19:01:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52315 conditions, 5958 events. 3968/5958 cut-off events. For 411502/411510 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 31657 event pairs, 845 based on Foata normal form. 14/5972 useless extension candidates. Maximal degree in co-relation 52206. Up to 5459 conditions per place. [2024-06-20 19:01:04,537 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 381 selfloop transitions, 81 changer transitions 0/465 dead transitions. [2024-06-20 19:01:04,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 465 transitions, 8560 flow [2024-06-20 19:01:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:01:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:01:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-20 19:01:04,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-20 19:01:04,539 INFO L175 Difference]: Start difference. First operand has 242 places, 398 transitions, 6679 flow. Second operand 10 states and 172 transitions. [2024-06-20 19:01:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 465 transitions, 8560 flow [2024-06-20 19:01:05,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 465 transitions, 8335 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-20 19:01:05,307 INFO L231 Difference]: Finished difference. Result has 249 places, 421 transitions, 7124 flow [2024-06-20 19:01:05,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6454, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7124, PETRI_PLACES=249, PETRI_TRANSITIONS=421} [2024-06-20 19:01:05,307 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places. [2024-06-20 19:01:05,308 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 421 transitions, 7124 flow [2024-06-20 19:01:05,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:05,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:05,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:05,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:01:05,308 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:05,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1863400338, now seen corresponding path program 1 times [2024-06-20 19:01:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649182138] [2024-06-20 19:01:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:17,280 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:01:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:17,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649182138] [2024-06-20 19:01:17,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649182138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:17,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:17,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112819655] [2024-06-20 19:01:17,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:17,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:17,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:17,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:17,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:01:17,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 421 transitions, 7124 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:01:17,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:17,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:01:17,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:19,549 INFO L124 PetriNetUnfolderBase]: 3996/6000 cut-off events. [2024-06-20 19:01:19,550 INFO L125 PetriNetUnfolderBase]: For 422806/422818 co-relation queries the response was YES. [2024-06-20 19:01:19,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53591 conditions, 6000 events. 3996/6000 cut-off events. For 422806/422818 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 31991 event pairs, 866 based on Foata normal form. 14/6014 useless extension candidates. Maximal degree in co-relation 53478. Up to 5776 conditions per place. [2024-06-20 19:01:19,622 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 387 selfloop transitions, 73 changer transitions 0/463 dead transitions. [2024-06-20 19:01:19,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 463 transitions, 8655 flow [2024-06-20 19:01:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:01:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:01:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-20 19:01:19,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-20 19:01:19,623 INFO L175 Difference]: Start difference. First operand has 249 places, 421 transitions, 7124 flow. Second operand 8 states and 135 transitions. [2024-06-20 19:01:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 463 transitions, 8655 flow [2024-06-20 19:01:20,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 463 transitions, 8394 flow, removed 91 selfloop flow, removed 5 redundant places. [2024-06-20 19:01:20,575 INFO L231 Difference]: Finished difference. Result has 254 places, 438 transitions, 7404 flow [2024-06-20 19:01:20,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6873, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7404, PETRI_PLACES=254, PETRI_TRANSITIONS=438} [2024-06-20 19:01:20,575 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-20 19:01:20,575 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 438 transitions, 7404 flow [2024-06-20 19:01:20,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:01:20,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:20,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:01:20,576 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 19:01:20,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1818582672, now seen corresponding path program 5 times [2024-06-20 19:01:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:20,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887596578] [2024-06-20 19:01:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:01:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887596578] [2024-06-20 19:01:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887596578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:28,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:28,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:01:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020958129] [2024-06-20 19:01:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:28,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:01:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:01:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:01:28,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:01:28,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 438 transitions, 7404 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:28,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:28,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:01:28,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:31,202 INFO L124 PetriNetUnfolderBase]: 4298/6454 cut-off events. [2024-06-20 19:01:31,202 INFO L125 PetriNetUnfolderBase]: For 465742/465750 co-relation queries the response was YES. [2024-06-20 19:01:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57878 conditions, 6454 events. 4298/6454 cut-off events. For 465742/465750 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 34990 event pairs, 810 based on Foata normal form. 14/6468 useless extension candidates. Maximal degree in co-relation 57762. Up to 5917 conditions per place. [2024-06-20 19:01:31,278 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 418 selfloop transitions, 107 changer transitions 0/528 dead transitions. [2024-06-20 19:01:31,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 528 transitions, 10027 flow [2024-06-20 19:01:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:01:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:01:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-20 19:01:31,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-20 19:01:31,279 INFO L175 Difference]: Start difference. First operand has 254 places, 438 transitions, 7404 flow. Second operand 10 states and 176 transitions. [2024-06-20 19:01:31,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 528 transitions, 10027 flow [2024-06-20 19:01:31,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 528 transitions, 9890 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-20 19:01:31,937 INFO L231 Difference]: Finished difference. Result has 263 places, 481 transitions, 8485 flow [2024-06-20 19:01:31,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7312, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8485, PETRI_PLACES=263, PETRI_TRANSITIONS=481} [2024-06-20 19:01:31,938 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places. [2024-06-20 19:01:31,938 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 481 transitions, 8485 flow [2024-06-20 19:01:31,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:31,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:31,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:31,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:01:31,939 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 19:01:31,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash -714538028, now seen corresponding path program 6 times [2024-06-20 19:01:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330449509] [2024-06-20 19:01:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:31,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:39,837 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:01:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330449509] [2024-06-20 19:01:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330449509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:01:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727429968] [2024-06-20 19:01:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:01:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:01:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:01:40,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:01:40,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 481 transitions, 8485 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:40,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:40,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:01:40,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:42,891 INFO L124 PetriNetUnfolderBase]: 4540/6804 cut-off events. [2024-06-20 19:01:42,891 INFO L125 PetriNetUnfolderBase]: For 513728/513736 co-relation queries the response was YES. [2024-06-20 19:01:42,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63094 conditions, 6804 events. 4540/6804 cut-off events. For 513728/513736 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37215 event pairs, 900 based on Foata normal form. 14/6818 useless extension candidates. Maximal degree in co-relation 62975. Up to 6280 conditions per place. [2024-06-20 19:01:42,973 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 432 selfloop transitions, 127 changer transitions 0/562 dead transitions. [2024-06-20 19:01:42,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 562 transitions, 11057 flow [2024-06-20 19:01:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:01:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:01:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-20 19:01:42,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-20 19:01:42,974 INFO L175 Difference]: Start difference. First operand has 263 places, 481 transitions, 8485 flow. Second operand 10 states and 176 transitions. [2024-06-20 19:01:42,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 562 transitions, 11057 flow [2024-06-20 19:01:43,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 562 transitions, 10902 flow, removed 73 selfloop flow, removed 2 redundant places. [2024-06-20 19:01:43,935 INFO L231 Difference]: Finished difference. Result has 273 places, 519 transitions, 9616 flow [2024-06-20 19:01:43,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8330, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9616, PETRI_PLACES=273, PETRI_TRANSITIONS=519} [2024-06-20 19:01:43,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-20 19:01:43,936 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 519 transitions, 9616 flow [2024-06-20 19:01:43,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:01:43,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:43,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 19:01:43,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:01:43,937 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 19:01:43,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -714541748, now seen corresponding path program 7 times [2024-06-20 19:01:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530097953] [2024-06-20 19:01:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:51,791 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:01:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530097953] [2024-06-20 19:01:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530097953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870230162] [2024-06-20 19:01:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:51,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:52,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-20 19:01:52,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 519 transitions, 9616 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:52,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:52,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-20 19:01:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:54,619 INFO L124 PetriNetUnfolderBase]: 4619/6930 cut-off events. [2024-06-20 19:01:54,619 INFO L125 PetriNetUnfolderBase]: For 549354/549358 co-relation queries the response was YES. [2024-06-20 19:01:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66110 conditions, 6930 events. 4619/6930 cut-off events. For 549354/549358 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38162 event pairs, 1128 based on Foata normal form. 10/6940 useless extension candidates. Maximal degree in co-relation 65987. Up to 5743 conditions per place. [2024-06-20 19:01:54,716 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 402 selfloop transitions, 158 changer transitions 0/563 dead transitions. [2024-06-20 19:01:54,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 563 transitions, 11588 flow [2024-06-20 19:01:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:01:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:01:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-20 19:01:54,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-20 19:01:54,717 INFO L175 Difference]: Start difference. First operand has 273 places, 519 transitions, 9616 flow. Second operand 8 states and 159 transitions. [2024-06-20 19:01:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 563 transitions, 11588 flow [2024-06-20 19:01:55,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 563 transitions, 11296 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-06-20 19:01:55,978 INFO L231 Difference]: Finished difference. Result has 276 places, 525 transitions, 9958 flow [2024-06-20 19:01:55,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9324, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9958, PETRI_PLACES=276, PETRI_TRANSITIONS=525} [2024-06-20 19:01:55,978 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2024-06-20 19:01:55,979 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 525 transitions, 9958 flow [2024-06-20 19:01:55,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:55,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:55,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:55,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:01:55,979 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:55,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1343072952, now seen corresponding path program 1 times [2024-06-20 19:01:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:55,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649962381] [2024-06-20 19:01:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:04,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 19:02:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649962381] [2024-06-20 19:02:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649962381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:04,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:04,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:02:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065000810] [2024-06-20 19:02:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:02:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:02:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:02:04,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:02:04,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 525 transitions, 9958 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:02:04,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:04,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:02:04,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:07,706 INFO L124 PetriNetUnfolderBase]: 4987/7479 cut-off events. [2024-06-20 19:02:07,706 INFO L125 PetriNetUnfolderBase]: For 653620/653628 co-relation queries the response was YES. [2024-06-20 19:02:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72165 conditions, 7479 events. 4987/7479 cut-off events. For 653620/653628 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 41775 event pairs, 905 based on Foata normal form. 44/7523 useless extension candidates. Maximal degree in co-relation 72041. Up to 6296 conditions per place. [2024-06-20 19:02:07,797 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 428 selfloop transitions, 169 changer transitions 0/600 dead transitions. [2024-06-20 19:02:07,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 600 transitions, 12218 flow [2024-06-20 19:02:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:02:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:02:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-20 19:02:07,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-20 19:02:07,798 INFO L175 Difference]: Start difference. First operand has 276 places, 525 transitions, 9958 flow. Second operand 10 states and 183 transitions. [2024-06-20 19:02:07,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 600 transitions, 12218 flow [2024-06-20 19:02:08,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 600 transitions, 11857 flow, removed 96 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:08,759 INFO L231 Difference]: Finished difference. Result has 285 places, 552 transitions, 10677 flow [2024-06-20 19:02:08,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9609, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10677, PETRI_PLACES=285, PETRI_TRANSITIONS=552} [2024-06-20 19:02:08,760 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-20 19:02:08,760 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 552 transitions, 10677 flow [2024-06-20 19:02:08,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:02:08,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:08,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:08,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:02:08,761 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:02:08,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1343065512, now seen corresponding path program 2 times [2024-06-20 19:02:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434414771] [2024-06-20 19:02:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:16,614 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:02:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:16,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434414771] [2024-06-20 19:02:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434414771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:16,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:02:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786996918] [2024-06-20 19:02:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:16,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:02:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:16,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:02:16,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:02:16,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:02:16,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 552 transitions, 10677 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:02:16,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:16,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:02:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:20,083 INFO L124 PetriNetUnfolderBase]: 5339/8055 cut-off events. [2024-06-20 19:02:20,083 INFO L125 PetriNetUnfolderBase]: For 697794/697802 co-relation queries the response was YES. [2024-06-20 19:02:20,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78549 conditions, 8055 events. 5339/8055 cut-off events. For 697794/697802 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 45919 event pairs, 960 based on Foata normal form. 32/8087 useless extension candidates. Maximal degree in co-relation 78419. Up to 6208 conditions per place. [2024-06-20 19:02:20,183 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 429 selfloop transitions, 180 changer transitions 0/612 dead transitions. [2024-06-20 19:02:20,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 612 transitions, 12950 flow [2024-06-20 19:02:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:02:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:02:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-20 19:02:20,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-20 19:02:20,185 INFO L175 Difference]: Start difference. First operand has 285 places, 552 transitions, 10677 flow. Second operand 10 states and 186 transitions. [2024-06-20 19:02:20,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 612 transitions, 12950 flow [2024-06-20 19:02:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 612 transitions, 12655 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:21,445 INFO L231 Difference]: Finished difference. Result has 291 places, 558 transitions, 11043 flow [2024-06-20 19:02:21,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10382, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11043, PETRI_PLACES=291, PETRI_TRANSITIONS=558} [2024-06-20 19:02:21,445 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places. [2024-06-20 19:02:21,446 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 558 transitions, 11043 flow [2024-06-20 19:02:21,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:02:21,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:21,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:21,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:02:21,446 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 19:02:21,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1348787244, now seen corresponding path program 8 times [2024-06-20 19:02:21,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:21,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473723692] [2024-06-20 19:02:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:02:30,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473723692] [2024-06-20 19:02:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473723692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:02:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339301373] [2024-06-20 19:02:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:02:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:02:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:02:30,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:02:30,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 558 transitions, 11043 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:02:30,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:30,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:02:30,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:33,780 INFO L124 PetriNetUnfolderBase]: 5329/8041 cut-off events. [2024-06-20 19:02:33,780 INFO L125 PetriNetUnfolderBase]: For 668878/668886 co-relation queries the response was YES. [2024-06-20 19:02:33,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77845 conditions, 8041 events. 5329/8041 cut-off events. For 668878/668886 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 45998 event pairs, 1028 based on Foata normal form. 14/8055 useless extension candidates. Maximal degree in co-relation 77713. Up to 7036 conditions per place. [2024-06-20 19:02:33,886 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 458 selfloop transitions, 145 changer transitions 0/606 dead transitions. [2024-06-20 19:02:33,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 606 transitions, 13036 flow [2024-06-20 19:02:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:02:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:02:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-20 19:02:33,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-20 19:02:33,888 INFO L175 Difference]: Start difference. First operand has 291 places, 558 transitions, 11043 flow. Second operand 10 states and 179 transitions. [2024-06-20 19:02:33,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 606 transitions, 13036 flow [2024-06-20 19:02:35,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 606 transitions, 12799 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:35,254 INFO L231 Difference]: Finished difference. Result has 299 places, 564 transitions, 11411 flow [2024-06-20 19:02:35,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10806, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11411, PETRI_PLACES=299, PETRI_TRANSITIONS=564} [2024-06-20 19:02:35,255 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-20 19:02:35,255 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 564 transitions, 11411 flow [2024-06-20 19:02:35,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:02:35,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:35,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:35,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:02:35,256 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 19:02:35,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1404093042, now seen corresponding path program 9 times [2024-06-20 19:02:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190769816] [2024-06-20 19:02:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:43,683 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:02:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190769816] [2024-06-20 19:02:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190769816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:43,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:02:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519029875] [2024-06-20 19:02:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:43,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:02:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:02:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:02:43,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:02:43,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 564 transitions, 11411 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:02:43,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:43,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:02:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:47,282 INFO L124 PetriNetUnfolderBase]: 5442/8212 cut-off events. [2024-06-20 19:02:47,282 INFO L125 PetriNetUnfolderBase]: For 705612/705620 co-relation queries the response was YES. [2024-06-20 19:02:47,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81200 conditions, 8212 events. 5442/8212 cut-off events. For 705612/705620 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 47061 event pairs, 1071 based on Foata normal form. 14/8226 useless extension candidates. Maximal degree in co-relation 81063. Up to 6827 conditions per place. [2024-06-20 19:02:47,380 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 464 selfloop transitions, 150 changer transitions 0/617 dead transitions. [2024-06-20 19:02:47,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 617 transitions, 13642 flow [2024-06-20 19:02:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:02:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:02:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-20 19:02:47,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-20 19:02:47,382 INFO L175 Difference]: Start difference. First operand has 299 places, 564 transitions, 11411 flow. Second operand 10 states and 184 transitions. [2024-06-20 19:02:47,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 617 transitions, 13642 flow [2024-06-20 19:02:48,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 617 transitions, 13319 flow, removed 70 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:48,826 INFO L231 Difference]: Finished difference. Result has 305 places, 570 transitions, 11686 flow [2024-06-20 19:02:48,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11088, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11686, PETRI_PLACES=305, PETRI_TRANSITIONS=570} [2024-06-20 19:02:48,827 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 263 predicate places. [2024-06-20 19:02:48,827 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 570 transitions, 11686 flow [2024-06-20 19:02:48,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:02:48,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:48,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:48,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:02:48,828 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:02:48,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash -266540386, now seen corresponding path program 2 times [2024-06-20 19:02:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:48,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855415363] [2024-06-20 19:02:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:01,800 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:03:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855415363] [2024-06-20 19:03:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855415363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195878182] [2024-06-20 19:03:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:01,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:01,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:03:01,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 570 transitions, 11686 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:01,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:01,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:03:01,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:05,049 INFO L124 PetriNetUnfolderBase]: 5449/8229 cut-off events. [2024-06-20 19:03:05,049 INFO L125 PetriNetUnfolderBase]: For 731136/731140 co-relation queries the response was YES. [2024-06-20 19:03:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81945 conditions, 8229 events. 5449/8229 cut-off events. For 731136/731140 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 47450 event pairs, 1499 based on Foata normal form. 7/8236 useless extension candidates. Maximal degree in co-relation 81806. Up to 8075 conditions per place. [2024-06-20 19:03:05,155 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 537 selfloop transitions, 62 changer transitions 0/602 dead transitions. [2024-06-20 19:03:05,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 602 transitions, 13278 flow [2024-06-20 19:03:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-20 19:03:05,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-20 19:03:05,157 INFO L175 Difference]: Start difference. First operand has 305 places, 570 transitions, 11686 flow. Second operand 8 states and 132 transitions. [2024-06-20 19:03:05,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 602 transitions, 13278 flow [2024-06-20 19:03:06,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 602 transitions, 12964 flow, removed 102 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:06,664 INFO L231 Difference]: Finished difference. Result has 308 places, 575 transitions, 11678 flow [2024-06-20 19:03:06,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11377, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11678, PETRI_PLACES=308, PETRI_TRANSITIONS=575} [2024-06-20 19:03:06,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2024-06-20 19:03:06,664 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 575 transitions, 11678 flow [2024-06-20 19:03:06,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:06,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:06,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:06,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:03:06,665 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:06,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 352219676, now seen corresponding path program 1 times [2024-06-20 19:03:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:06,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998660999] [2024-06-20 19:03:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:19,488 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:03:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998660999] [2024-06-20 19:03:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998660999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916529867] [2024-06-20 19:03:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:19,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:19,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:19,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:19,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:03:19,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 575 transitions, 11678 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:19,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:19,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:03:19,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:22,751 INFO L124 PetriNetUnfolderBase]: 5454/8233 cut-off events. [2024-06-20 19:03:22,751 INFO L125 PetriNetUnfolderBase]: For 731495/731499 co-relation queries the response was YES. [2024-06-20 19:03:22,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81464 conditions, 8233 events. 5454/8233 cut-off events. For 731495/731499 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 47473 event pairs, 1507 based on Foata normal form. 5/8238 useless extension candidates. Maximal degree in co-relation 81323. Up to 8141 conditions per place. [2024-06-20 19:03:22,866 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 566 selfloop transitions, 34 changer transitions 0/603 dead transitions. [2024-06-20 19:03:22,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 603 transitions, 13148 flow [2024-06-20 19:03:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-20 19:03:22,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-20 19:03:22,867 INFO L175 Difference]: Start difference. First operand has 308 places, 575 transitions, 11678 flow. Second operand 8 states and 126 transitions. [2024-06-20 19:03:22,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 603 transitions, 13148 flow [2024-06-20 19:03:24,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 603 transitions, 12986 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:24,631 INFO L231 Difference]: Finished difference. Result has 311 places, 584 transitions, 11703 flow [2024-06-20 19:03:24,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11516, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11703, PETRI_PLACES=311, PETRI_TRANSITIONS=584} [2024-06-20 19:03:24,632 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 269 predicate places. [2024-06-20 19:03:24,632 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 584 transitions, 11703 flow [2024-06-20 19:03:24,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:24,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:24,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:24,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:03:24,633 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:24,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 351325574, now seen corresponding path program 3 times [2024-06-20 19:03:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193764335] [2024-06-20 19:03:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:37,699 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:03:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193764335] [2024-06-20 19:03:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193764335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637126622] [2024-06-20 19:03:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:37,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:37,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:03:37,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 584 transitions, 11703 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:37,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:03:37,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:41,049 INFO L124 PetriNetUnfolderBase]: 5448/8228 cut-off events. [2024-06-20 19:03:41,049 INFO L125 PetriNetUnfolderBase]: For 750485/750489 co-relation queries the response was YES. [2024-06-20 19:03:41,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81780 conditions, 8228 events. 5448/8228 cut-off events. For 750485/750489 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 47438 event pairs, 1496 based on Foata normal form. 6/8234 useless extension candidates. Maximal degree in co-relation 81637. Up to 8077 conditions per place. [2024-06-20 19:03:41,168 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 545 selfloop transitions, 64 changer transitions 0/612 dead transitions. [2024-06-20 19:03:41,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 612 transitions, 13045 flow [2024-06-20 19:03:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:03:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:03:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-20 19:03:41,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37073170731707317 [2024-06-20 19:03:41,169 INFO L175 Difference]: Start difference. First operand has 311 places, 584 transitions, 11703 flow. Second operand 10 states and 152 transitions. [2024-06-20 19:03:41,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 612 transitions, 13045 flow [2024-06-20 19:03:42,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 612 transitions, 12977 flow, removed 33 selfloop flow, removed 1 redundant places. [2024-06-20 19:03:42,870 INFO L231 Difference]: Finished difference. Result has 320 places, 584 transitions, 11771 flow [2024-06-20 19:03:42,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11635, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11771, PETRI_PLACES=320, PETRI_TRANSITIONS=584} [2024-06-20 19:03:42,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-20 19:03:42,871 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 584 transitions, 11771 flow [2024-06-20 19:03:42,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:03:42,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:42,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 19:03:42,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:03:42,871 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:42,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash -642777206, now seen corresponding path program 10 times [2024-06-20 19:03:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:42,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973400758] [2024-06-20 19:03:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:42,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:03:51,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973400758] [2024-06-20 19:03:51,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973400758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:51,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:51,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:03:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489015885] [2024-06-20 19:03:51,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:51,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:03:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:03:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:03:51,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:03:51,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 584 transitions, 11771 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:03:51,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:51,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:03:51,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:54,807 INFO L124 PetriNetUnfolderBase]: 5502/8307 cut-off events. [2024-06-20 19:03:54,807 INFO L125 PetriNetUnfolderBase]: For 800919/800927 co-relation queries the response was YES. [2024-06-20 19:03:54,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83632 conditions, 8307 events. 5502/8307 cut-off events. For 800919/800927 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 47681 event pairs, 1133 based on Foata normal form. 14/8321 useless extension candidates. Maximal degree in co-relation 83486. Up to 7306 conditions per place. [2024-06-20 19:03:54,931 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 473 selfloop transitions, 150 changer transitions 0/626 dead transitions. [2024-06-20 19:03:54,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 626 transitions, 13773 flow [2024-06-20 19:03:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-20 19:03:54,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-20 19:03:54,932 INFO L175 Difference]: Start difference. First operand has 320 places, 584 transitions, 11771 flow. Second operand 9 states and 155 transitions. [2024-06-20 19:03:54,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 626 transitions, 13773 flow [2024-06-20 19:03:56,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 626 transitions, 13637 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:03:56,631 INFO L231 Difference]: Finished difference. Result has 322 places, 590 transitions, 12307 flow [2024-06-20 19:03:56,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12307, PETRI_PLACES=322, PETRI_TRANSITIONS=590} [2024-06-20 19:03:56,631 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-20 19:03:56,632 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 590 transitions, 12307 flow [2024-06-20 19:03:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:03:56,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:56,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:03:56,632 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:56,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -640899536, now seen corresponding path program 11 times [2024-06-20 19:03:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225486600] [2024-06-20 19:03:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:04:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225486600] [2024-06-20 19:04:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225486600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:06,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:04:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077341406] [2024-06-20 19:04:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:04:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:04:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:04:06,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:04:06,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 590 transitions, 12307 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:06,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:06,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:04:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:09,629 INFO L124 PetriNetUnfolderBase]: 5505/8322 cut-off events. [2024-06-20 19:04:09,629 INFO L125 PetriNetUnfolderBase]: For 809389/809393 co-relation queries the response was YES. [2024-06-20 19:04:09,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85108 conditions, 8322 events. 5505/8322 cut-off events. For 809389/809393 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 48137 event pairs, 1349 based on Foata normal form. 10/8332 useless extension candidates. Maximal degree in co-relation 84960. Up to 7457 conditions per place. [2024-06-20 19:04:09,750 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 445 selfloop transitions, 180 changer transitions 0/628 dead transitions. [2024-06-20 19:04:09,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 628 transitions, 14051 flow [2024-06-20 19:04:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-20 19:04:09,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-20 19:04:09,752 INFO L175 Difference]: Start difference. First operand has 322 places, 590 transitions, 12307 flow. Second operand 9 states and 156 transitions. [2024-06-20 19:04:09,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 628 transitions, 14051 flow [2024-06-20 19:04:11,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 628 transitions, 13730 flow, removed 96 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:11,702 INFO L231 Difference]: Finished difference. Result has 326 places, 593 transitions, 12502 flow [2024-06-20 19:04:11,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11986, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12502, PETRI_PLACES=326, PETRI_TRANSITIONS=593} [2024-06-20 19:04:11,703 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 284 predicate places. [2024-06-20 19:04:11,703 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 593 transitions, 12502 flow [2024-06-20 19:04:11,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:11,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:11,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:11,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:04:11,703 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:11,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1275148752, now seen corresponding path program 12 times [2024-06-20 19:04:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884669911] [2024-06-20 19:04:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:20,487 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:04:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884669911] [2024-06-20 19:04:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884669911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:20,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:04:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380946335] [2024-06-20 19:04:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:04:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:04:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:04:20,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:04:20,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 593 transitions, 12502 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:20,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:20,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:04:20,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:24,298 INFO L124 PetriNetUnfolderBase]: 5533/8352 cut-off events. [2024-06-20 19:04:24,298 INFO L125 PetriNetUnfolderBase]: For 827798/827806 co-relation queries the response was YES. [2024-06-20 19:04:24,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85747 conditions, 8352 events. 5533/8352 cut-off events. For 827798/827806 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 48155 event pairs, 1058 based on Foata normal form. 14/8366 useless extension candidates. Maximal degree in co-relation 85597. Up to 6906 conditions per place. [2024-06-20 19:04:24,405 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 437 selfloop transitions, 191 changer transitions 0/631 dead transitions. [2024-06-20 19:04:24,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 631 transitions, 14410 flow [2024-06-20 19:04:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-20 19:04:24,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-20 19:04:24,407 INFO L175 Difference]: Start difference. First operand has 326 places, 593 transitions, 12502 flow. Second operand 9 states and 160 transitions. [2024-06-20 19:04:24,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 631 transitions, 14410 flow [2024-06-20 19:04:26,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 631 transitions, 13974 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-20 19:04:26,352 INFO L231 Difference]: Finished difference. Result has 328 places, 596 transitions, 12624 flow [2024-06-20 19:04:26,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12066, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12624, PETRI_PLACES=328, PETRI_TRANSITIONS=596} [2024-06-20 19:04:26,352 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 286 predicate places. [2024-06-20 19:04:26,352 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 596 transitions, 12624 flow [2024-06-20 19:04:26,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:26,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:26,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:26,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:04:26,353 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:26,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1275152472, now seen corresponding path program 13 times [2024-06-20 19:04:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276750062] [2024-06-20 19:04:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:34,905 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:04:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276750062] [2024-06-20 19:04:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276750062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:34,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978102754] [2024-06-20 19:04:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:34,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:35,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:04:35,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 596 transitions, 12624 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:04:35,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:35,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:04:35,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:38,893 INFO L124 PetriNetUnfolderBase]: 5782/8745 cut-off events. [2024-06-20 19:04:38,893 INFO L125 PetriNetUnfolderBase]: For 926372/926380 co-relation queries the response was YES. [2024-06-20 19:04:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92983 conditions, 8745 events. 5782/8745 cut-off events. For 926372/926380 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 50983 event pairs, 1152 based on Foata normal form. 14/8759 useless extension candidates. Maximal degree in co-relation 92832. Up to 6527 conditions per place. [2024-06-20 19:04:39,010 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 442 selfloop transitions, 199 changer transitions 0/644 dead transitions. [2024-06-20 19:04:39,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 644 transitions, 15028 flow [2024-06-20 19:04:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-20 19:04:39,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44986449864498645 [2024-06-20 19:04:39,012 INFO L175 Difference]: Start difference. First operand has 328 places, 596 transitions, 12624 flow. Second operand 9 states and 166 transitions. [2024-06-20 19:04:39,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 644 transitions, 15028 flow [2024-06-20 19:04:40,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 644 transitions, 14546 flow, removed 75 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:40,791 INFO L231 Difference]: Finished difference. Result has 332 places, 602 transitions, 12872 flow [2024-06-20 19:04:40,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12142, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12872, PETRI_PLACES=332, PETRI_TRANSITIONS=602} [2024-06-20 19:04:40,791 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 290 predicate places. [2024-06-20 19:04:40,791 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 602 transitions, 12872 flow [2024-06-20 19:04:40,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:04:40,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:40,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:40,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:04:40,792 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:40,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1269642222, now seen corresponding path program 14 times [2024-06-20 19:04:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468906732] [2024-06-20 19:04:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:50,034 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:04:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:50,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468906732] [2024-06-20 19:04:50,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468906732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:04:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635540753] [2024-06-20 19:04:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:04:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:04:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:04:50,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:04:50,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 602 transitions, 12872 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:50,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:50,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:04:50,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:53,898 INFO L124 PetriNetUnfolderBase]: 5798/8773 cut-off events. [2024-06-20 19:04:53,898 INFO L125 PetriNetUnfolderBase]: For 1001771/1001779 co-relation queries the response was YES. [2024-06-20 19:04:53,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92717 conditions, 8773 events. 5798/8773 cut-off events. For 1001771/1001779 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 51317 event pairs, 1062 based on Foata normal form. 44/8817 useless extension candidates. Maximal degree in co-relation 92564. Up to 6969 conditions per place. [2024-06-20 19:04:54,031 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 417 selfloop transitions, 223 changer transitions 0/643 dead transitions. [2024-06-20 19:04:54,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 643 transitions, 14728 flow [2024-06-20 19:04:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 19:04:54,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 19:04:54,032 INFO L175 Difference]: Start difference. First operand has 332 places, 602 transitions, 12872 flow. Second operand 9 states and 164 transitions. [2024-06-20 19:04:54,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 643 transitions, 14728 flow [2024-06-20 19:04:56,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 643 transitions, 14268 flow, removed 114 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:56,312 INFO L231 Difference]: Finished difference. Result has 336 places, 605 transitions, 13056 flow [2024-06-20 19:04:56,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12442, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13056, PETRI_PLACES=336, PETRI_TRANSITIONS=605} [2024-06-20 19:04:56,313 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 294 predicate places. [2024-06-20 19:04:56,313 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 605 transitions, 13056 flow [2024-06-20 19:04:56,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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 19:04:56,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:56,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:56,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:04:56,313 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:56,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1269427020, now seen corresponding path program 3 times [2024-06-20 19:04:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635864076] [2024-06-20 19:04:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635864076] [2024-06-20 19:05:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635864076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5697170] [2024-06-20 19:05:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:05,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:05,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:05:05,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 605 transitions, 13056 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:05:05,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:05,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:05:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:09,601 INFO L124 PetriNetUnfolderBase]: 5988/9087 cut-off events. [2024-06-20 19:05:09,601 INFO L125 PetriNetUnfolderBase]: For 1030465/1030473 co-relation queries the response was YES. [2024-06-20 19:05:09,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96744 conditions, 9087 events. 5988/9087 cut-off events. For 1030465/1030473 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 53519 event pairs, 1054 based on Foata normal form. 32/9119 useless extension candidates. Maximal degree in co-relation 96589. Up to 6065 conditions per place. [2024-06-20 19:05:09,747 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 404 selfloop transitions, 245 changer transitions 0/652 dead transitions. [2024-06-20 19:05:09,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 652 transitions, 15272 flow [2024-06-20 19:05:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-20 19:05:09,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45257452574525747 [2024-06-20 19:05:09,748 INFO L175 Difference]: Start difference. First operand has 336 places, 605 transitions, 13056 flow. Second operand 9 states and 167 transitions. [2024-06-20 19:05:09,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 652 transitions, 15272 flow [2024-06-20 19:05:12,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 652 transitions, 14738 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:12,233 INFO L231 Difference]: Finished difference. Result has 338 places, 609 transitions, 13286 flow [2024-06-20 19:05:12,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12522, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13286, PETRI_PLACES=338, PETRI_TRANSITIONS=609} [2024-06-20 19:05:12,233 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 296 predicate places. [2024-06-20 19:05:12,234 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 609 transitions, 13286 flow [2024-06-20 19:05:12,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:05:12,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:12,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:12,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:05:12,234 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:05:12,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 342795238, now seen corresponding path program 4 times [2024-06-20 19:05:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122833155] [2024-06-20 19:05:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:26,268 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:05:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:26,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122833155] [2024-06-20 19:05:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122833155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:26,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:26,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:05:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642895780] [2024-06-20 19:05:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:05:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:05:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:05:26,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:05:26,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 609 transitions, 13286 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:05:26,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:26,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:05:26,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:30,105 INFO L124 PetriNetUnfolderBase]: 5995/9105 cut-off events. [2024-06-20 19:05:30,105 INFO L125 PetriNetUnfolderBase]: For 991628/991632 co-relation queries the response was YES. [2024-06-20 19:05:30,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96513 conditions, 9105 events. 5995/9105 cut-off events. For 991628/991632 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 53992 event pairs, 1631 based on Foata normal form. 7/9112 useless extension candidates. Maximal degree in co-relation 96357. Up to 8855 conditions per place. [2024-06-20 19:05:30,238 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 532 selfloop transitions, 100 changer transitions 0/635 dead transitions. [2024-06-20 19:05:30,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 635 transitions, 14917 flow [2024-06-20 19:05:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:05:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:05:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-20 19:05:30,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-20 19:05:30,240 INFO L175 Difference]: Start difference. First operand has 338 places, 609 transitions, 13286 flow. Second operand 7 states and 118 transitions. [2024-06-20 19:05:30,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 635 transitions, 14917 flow [2024-06-20 19:05:32,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 635 transitions, 14469 flow, removed 71 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:32,558 INFO L231 Difference]: Finished difference. Result has 339 places, 614 transitions, 13242 flow [2024-06-20 19:05:32,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12847, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13242, PETRI_PLACES=339, PETRI_TRANSITIONS=614} [2024-06-20 19:05:32,558 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 297 predicate places. [2024-06-20 19:05:32,558 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 614 transitions, 13242 flow [2024-06-20 19:05:32,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:05:32,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:32,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:32,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:05:32,559 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:05:32,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 343094140, now seen corresponding path program 2 times [2024-06-20 19:05:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:32,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132277587] [2024-06-20 19:05:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:45,686 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:05:45,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132277587] [2024-06-20 19:05:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132277587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:05:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240866356] [2024-06-20 19:05:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:45,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:05:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:05:45,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:05:45,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-20 19:05:45,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 614 transitions, 13242 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:05:45,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:45,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-20 19:05:45,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15