./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_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-bcb38a6-m [2024-06-03 22:31:11,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:31:11,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:31:11,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:31:11,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:31:12,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:31:12,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:31:12,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:31:12,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:31:12,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:31:12,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:31:12,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:31:12,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:31:12,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:31:12,020 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:31:12,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:31:12,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:31:12,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:31:12,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:31:12,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:31:12,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:31:12,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:31:12,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:31:12,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:31:12,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:31:12,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:31:12,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:31:12,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:31:12,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:31:12,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:31:12,026 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:31:12,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:31:12,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:31:12,026 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-03 22:31:12,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:31:12,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:31:12,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:31:12,272 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:31:12,273 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:31:12,274 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:31:12,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:31:12,464 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:31:12,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:13,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:31:13,684 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:31:13,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:13,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c522cf3d/cd3d05ebdb12409590e09a50c7251a74/FLAG8f365ccfc [2024-06-03 22:31:13,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c522cf3d/cd3d05ebdb12409590e09a50c7251a74 [2024-06-03 22:31:13,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:31:13,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:31:13,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:31:13,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:31:13,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:31:13,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:12" (1/2) ... [2024-06-03 22:31:13,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715e1fcd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:13, skipping insertion in model container [2024-06-03 22:31:13,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:12" (1/2) ... [2024-06-03 22:31:13,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@763b31bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:13, skipping insertion in model container [2024-06-03 22:31:13,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:31:13" (2/2) ... [2024-06-03 22:31:13,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715e1fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:13, skipping insertion in model container [2024-06-03 22:31:13,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:31:13" (2/2) ... [2024-06-03 22:31:13,741 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:31:13,814 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:31:13,816 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-03 22:31:13,816 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-03 22:31:13,817 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-03 22:31:13,817 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:31:13,817 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-03 22:31:13,855 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:31:14,108 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:31:14,119 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:31:14,432 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:31:14,466 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:31:14,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14 WrapperNode [2024-06-03 22:31:14,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:31:14,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:31:14,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:31:14,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:31:14,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,669 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-03 22:31:14,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:31:14,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:31:14,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:31:14,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:31:14,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,770 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-03 22:31:14,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:31:14,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:31:14,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:31:14,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:31:14,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (1/1) ... [2024-06-03 22:31:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:31:14,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:31:14,867 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-03 22:31:14,878 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-03 22:31:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:31:14,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:31:14,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:31:14,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:31:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:31:14,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:31:14,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:31:14,904 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:31:15,031 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:31:15,033 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:31:15,955 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:31:15,956 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:31:16,194 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:31:16,194 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:31:16,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:31:16 BoogieIcfgContainer [2024-06-03 22:31:16,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:31:16,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:31:16,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:31:16,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:31:16,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:12" (1/4) ... [2024-06-03 22:31:16,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e8f3c3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:31:16, skipping insertion in model container [2024-06-03 22:31:16,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:31:13" (2/4) ... [2024-06-03 22:31:16,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e8f3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:31:16, skipping insertion in model container [2024-06-03 22:31:16,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:14" (3/4) ... [2024-06-03 22:31:16,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e8f3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:31:16, skipping insertion in model container [2024-06-03 22:31:16,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:31:16" (4/4) ... [2024-06-03 22:31:16,200 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:16,212 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:31:16,213 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:31:16,213 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:31:16,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:31:16,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:31:16,349 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:31:16,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:31:16,352 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 63 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-03 22:31:16,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:31:16,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:31:16,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:31:16,398 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;@7f62bf71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:31:16,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:31:16,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:31:16,404 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:31:16,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:31:16,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:16,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:31:16,405 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-03 22:31:16,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1352874220, now seen corresponding path program 1 times [2024-06-03 22:31:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:16,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298590812] [2024-06-03 22:31:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298590812] [2024-06-03 22:31:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298590812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:21,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:31:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731475805] [2024-06-03 22:31:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:21,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:31:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:21,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:31:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:31:21,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:31:21,218 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.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:21,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:21,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:31:21,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:21,904 INFO L124 PetriNetUnfolderBase]: 1156/1755 cut-off events. [2024-06-03 22:31:21,904 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-03 22:31:21,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1755 events. 1156/1755 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8046 event pairs, 805 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3569. Up to 1740 conditions per place. [2024-06-03 22:31:21,921 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-03 22:31:21,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2024-06-03 22:31:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:31:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:31:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-03 22:31:21,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-06-03 22:31:21,932 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions. [2024-06-03 22:31:21,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2024-06-03 22:31:21,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:31:21,938 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:31:21,939 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-03 22:31:21,942 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:31:21,942 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:31:21,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:21,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:21,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:21,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:31:21,943 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-03 22:31:21,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1263011443, now seen corresponding path program 1 times [2024-06-03 22:31:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:21,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981526761] [2024-06-03 22:31:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:21,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981526761] [2024-06-03 22:31:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981526761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:31:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064022074] [2024-06-03 22:31:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:25,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:31:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:31:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:31:25,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:31:25,596 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.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:25,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:25,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:31:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:26,208 INFO L124 PetriNetUnfolderBase]: 1150/1746 cut-off events. [2024-06-03 22:31:26,209 INFO L125 PetriNetUnfolderBase]: For 327/334 co-relation queries the response was YES. [2024-06-03 22:31:26,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1746 events. 1150/1746 cut-off events. For 327/334 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7823 event pairs, 699 based on Foata normal form. 7/1749 useless extension candidates. Maximal degree in co-relation 4040. Up to 1716 conditions per place. [2024-06-03 22:31:26,218 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-03 22:31:26,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow [2024-06-03 22:31:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:31:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:31:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-03 22:31:26,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2024-06-03 22:31:26,220 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 90 transitions. [2024-06-03 22:31:26,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow [2024-06-03 22:31:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:31:26,221 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-03 22:31:26,222 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-03 22:31:26,222 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-03 22:31:26,222 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-03 22:31:26,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:26,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:26,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:26,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:31:26,223 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-03 22:31:26,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 498650573, now seen corresponding path program 1 times [2024-06-03 22:31:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949620608] [2024-06-03 22:31:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949620608] [2024-06-03 22:31:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949620608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:31:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487042697] [2024-06-03 22:31:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:29,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:31:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:31:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:31:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:29,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:29,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:29,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:29,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:30,023 INFO L124 PetriNetUnfolderBase]: 1385/2087 cut-off events. [2024-06-03 22:31:30,023 INFO L125 PetriNetUnfolderBase]: For 1057/1065 co-relation queries the response was YES. [2024-06-03 22:31:30,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 2087 events. 1385/2087 cut-off events. For 1057/1065 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9351 event pairs, 709 based on Foata normal form. 9/2093 useless extension candidates. Maximal degree in co-relation 5351. Up to 2043 conditions per place. [2024-06-03 22:31:30,034 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-03 22:31:30,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 357 flow [2024-06-03 22:31:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:31:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:31:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-03 22:31:30,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170731707317073 [2024-06-03 22:31:30,039 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 106 transitions. [2024-06-03 22:31:30,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 357 flow [2024-06-03 22:31:30,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 336 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 22:31:30,043 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 206 flow [2024-06-03 22:31:30,043 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-06-03 22:31:30,044 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-03 22:31:30,044 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 206 flow [2024-06-03 22:31:30,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:30,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:30,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:31:30,045 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-03 22:31:30,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1721699886, now seen corresponding path program 1 times [2024-06-03 22:31:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772524095] [2024-06-03 22:31:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772524095] [2024-06-03 22:31:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772524095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:33,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:31:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501405924] [2024-06-03 22:31:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:33,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:31:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:31:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:31:33,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:33,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 206 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-03 22:31:33,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:33,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:33,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:34,464 INFO L124 PetriNetUnfolderBase]: 1393/2098 cut-off events. [2024-06-03 22:31:34,465 INFO L125 PetriNetUnfolderBase]: For 1918/1937 co-relation queries the response was YES. [2024-06-03 22:31:34,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 2098 events. 1393/2098 cut-off events. For 1918/1937 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9437 event pairs, 583 based on Foata normal form. 17/2112 useless extension candidates. Maximal degree in co-relation 5931. Up to 1989 conditions per place. [2024-06-03 22:31:34,477 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 71 selfloop transitions, 20 changer transitions 0/95 dead transitions. [2024-06-03 22:31:34,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 538 flow [2024-06-03 22:31:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:31:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:31:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-03 22:31:34,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2024-06-03 22:31:34,479 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 206 flow. Second operand 6 states and 136 transitions. [2024-06-03 22:31:34,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 538 flow [2024-06-03 22:31:34,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 95 transitions, 534 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-03 22:31:34,483 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 334 flow [2024-06-03 22:31:34,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2024-06-03 22:31:34,484 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-03 22:31:34,485 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 334 flow [2024-06-03 22:31:34,485 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-03 22:31:34,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:34,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:34,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:31:34,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:31:34,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1833087348, now seen corresponding path program 1 times [2024-06-03 22:31:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352791241] [2024-06-03 22:31:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:38,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:38,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352791241] [2024-06-03 22:31:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352791241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:31:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036070973] [2024-06-03 22:31:38,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:38,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:31:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:38,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:31:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:31:38,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:38,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:38,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:38,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:38,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:39,240 INFO L124 PetriNetUnfolderBase]: 1384/2083 cut-off events. [2024-06-03 22:31:39,240 INFO L125 PetriNetUnfolderBase]: For 3567/3586 co-relation queries the response was YES. [2024-06-03 22:31:39,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2083 events. 1384/2083 cut-off events. For 3567/3586 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9297 event pairs, 447 based on Foata normal form. 18/2098 useless extension candidates. Maximal degree in co-relation 6944. Up to 1994 conditions per place. [2024-06-03 22:31:39,258 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 77 selfloop transitions, 15 changer transitions 0/96 dead transitions. [2024-06-03 22:31:39,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 620 flow [2024-06-03 22:31:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-03 22:31:39,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 22:31:39,261 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 334 flow. Second operand 7 states and 140 transitions. [2024-06-03 22:31:39,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 620 flow [2024-06-03 22:31:39,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 606 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-03 22:31:39,266 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 387 flow [2024-06-03 22:31:39,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=387, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-03 22:31:39,267 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-03 22:31:39,267 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 387 flow [2024-06-03 22:31:39,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:39,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:39,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:31:39,268 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-03 22:31:39,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1504971726, now seen corresponding path program 1 times [2024-06-03 22:31:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57489752] [2024-06-03 22:31:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57489752] [2024-06-03 22:31:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57489752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:31:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653491822] [2024-06-03 22:31:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:46,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:31:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:46,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:31:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:31:47,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:31:47,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:47,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:47,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:31:47,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:47,897 INFO L124 PetriNetUnfolderBase]: 1613/2412 cut-off events. [2024-06-03 22:31:47,897 INFO L125 PetriNetUnfolderBase]: For 5248/5248 co-relation queries the response was YES. [2024-06-03 22:31:47,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 2412 events. 1613/2412 cut-off events. For 5248/5248 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10974 event pairs, 567 based on Foata normal form. 6/2416 useless extension candidates. Maximal degree in co-relation 8339. Up to 2357 conditions per place. [2024-06-03 22:31:47,910 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 66 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-06-03 22:31:47,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 595 flow [2024-06-03 22:31:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:31:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:31:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-03 22:31:47,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-03 22:31:47,914 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 387 flow. Second operand 5 states and 86 transitions. [2024-06-03 22:31:47,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 595 flow [2024-06-03 22:31:47,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 562 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:31:47,920 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 415 flow [2024-06-03 22:31:47,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-03 22:31:47,922 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-03 22:31:47,923 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 415 flow [2024-06-03 22:31:47,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:47,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:47,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:31:47,923 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-03 22:31:47,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 948681495, now seen corresponding path program 1 times [2024-06-03 22:31:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065058254] [2024-06-03 22:31:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065058254] [2024-06-03 22:31:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065058254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:54,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583381768] [2024-06-03 22:31:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:54,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:54,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:54,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:31:54,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 415 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:54,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:54,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:31:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:55,191 INFO L124 PetriNetUnfolderBase]: 1548/2328 cut-off events. [2024-06-03 22:31:55,191 INFO L125 PetriNetUnfolderBase]: For 7938/7988 co-relation queries the response was YES. [2024-06-03 22:31:55,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 2328 events. 1548/2328 cut-off events. For 7938/7988 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10693 event pairs, 587 based on Foata normal form. 14/2290 useless extension candidates. Maximal degree in co-relation 8858. Up to 2198 conditions per place. [2024-06-03 22:31:55,204 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 74 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-06-03 22:31:55,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 749 flow [2024-06-03 22:31:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:31:55,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-03 22:31:55,207 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 415 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:31:55,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 749 flow [2024-06-03 22:31:55,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 718 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 22:31:55,213 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 492 flow [2024-06-03 22:31:55,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-06-03 22:31:55,214 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-03 22:31:55,214 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 492 flow [2024-06-03 22:31:55,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:55,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:55,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:31:55,215 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-03 22:31:55,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 948801651, now seen corresponding path program 1 times [2024-06-03 22:31:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386625377] [2024-06-03 22:31:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386625377] [2024-06-03 22:32:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386625377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665703626] [2024-06-03 22:32:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:02,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:02,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:02,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 492 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:02,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:02,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:02,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:03,158 INFO L124 PetriNetUnfolderBase]: 1719/2563 cut-off events. [2024-06-03 22:32:03,158 INFO L125 PetriNetUnfolderBase]: For 9327/9329 co-relation queries the response was YES. [2024-06-03 22:32:03,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10135 conditions, 2563 events. 1719/2563 cut-off events. For 9327/9329 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11693 event pairs, 522 based on Foata normal form. 8/2569 useless extension candidates. Maximal degree in co-relation 10102. Up to 2414 conditions per place. [2024-06-03 22:32:03,171 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 95 selfloop transitions, 28 changer transitions 0/126 dead transitions. [2024-06-03 22:32:03,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 997 flow [2024-06-03 22:32:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:32:03,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:32:03,172 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 492 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:32:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 997 flow [2024-06-03 22:32:03,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 956 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-03 22:32:03,181 INFO L231 Difference]: Finished difference. Result has 79 places, 95 transitions, 720 flow [2024-06-03 22:32:03,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=720, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2024-06-03 22:32:03,182 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-03 22:32:03,182 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 720 flow [2024-06-03 22:32:03,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:03,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:03,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:03,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:32:03,183 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-03 22:32:03,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash 948801465, now seen corresponding path program 2 times [2024-06-03 22:32:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452036294] [2024-06-03 22:32:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452036294] [2024-06-03 22:32:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452036294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759444991] [2024-06-03 22:32:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:09,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:32:09,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 720 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:09,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:09,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:32:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:10,868 INFO L124 PetriNetUnfolderBase]: 1697/2548 cut-off events. [2024-06-03 22:32:10,868 INFO L125 PetriNetUnfolderBase]: For 12441/12461 co-relation queries the response was YES. [2024-06-03 22:32:10,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 2548 events. 1697/2548 cut-off events. For 12441/12461 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11654 event pairs, 532 based on Foata normal form. 15/2550 useless extension candidates. Maximal degree in co-relation 11109. Up to 2406 conditions per place. [2024-06-03 22:32:10,881 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 27 changer transitions 0/123 dead transitions. [2024-06-03 22:32:10,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 123 transitions, 1059 flow [2024-06-03 22:32:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:32:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:32:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 22:32:10,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-03 22:32:10,883 INFO L175 Difference]: Start difference. First operand has 79 places, 95 transitions, 720 flow. Second operand 7 states and 121 transitions. [2024-06-03 22:32:10,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 123 transitions, 1059 flow [2024-06-03 22:32:10,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 123 transitions, 1021 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-03 22:32:10,896 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 808 flow [2024-06-03 22:32:10,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2024-06-03 22:32:10,896 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-03 22:32:10,897 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 808 flow [2024-06-03 22:32:10,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:10,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:10,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:10,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:32:10,897 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-03 22:32:10,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 483946513, now seen corresponding path program 2 times [2024-06-03 22:32:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215803526] [2024-06-03 22:32:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215803526] [2024-06-03 22:32:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215803526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358042061] [2024-06-03 22:32:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:17,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:17,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 808 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:17,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:17,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:17,958 INFO L124 PetriNetUnfolderBase]: 1762/2625 cut-off events. [2024-06-03 22:32:17,958 INFO L125 PetriNetUnfolderBase]: For 13891/13895 co-relation queries the response was YES. [2024-06-03 22:32:17,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11762 conditions, 2625 events. 1762/2625 cut-off events. For 13891/13895 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11887 event pairs, 600 based on Foata normal form. 5/2628 useless extension candidates. Maximal degree in co-relation 11722. Up to 2500 conditions per place. [2024-06-03 22:32:17,971 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 116 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2024-06-03 22:32:17,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 142 transitions, 1366 flow [2024-06-03 22:32:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 22:32:17,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-03 22:32:17,974 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 808 flow. Second operand 6 states and 107 transitions. [2024-06-03 22:32:17,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 142 transitions, 1366 flow [2024-06-03 22:32:17,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 142 transitions, 1280 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:17,991 INFO L231 Difference]: Finished difference. Result has 88 places, 117 transitions, 980 flow [2024-06-03 22:32:17,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=88, PETRI_TRANSITIONS=117} [2024-06-03 22:32:17,992 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-03 22:32:17,992 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 117 transitions, 980 flow [2024-06-03 22:32:17,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:17,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:17,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:17,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:32:17,993 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-03 22:32:17,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 483946327, now seen corresponding path program 3 times [2024-06-03 22:32:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387227772] [2024-06-03 22:32:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387227772] [2024-06-03 22:32:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387227772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460240007] [2024-06-03 22:32:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:24,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:32:24,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 117 transitions, 980 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:24,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:24,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:32:24,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:25,731 INFO L124 PetriNetUnfolderBase]: 1676/2518 cut-off events. [2024-06-03 22:32:25,732 INFO L125 PetriNetUnfolderBase]: For 18245/18362 co-relation queries the response was YES. [2024-06-03 22:32:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11938 conditions, 2518 events. 1676/2518 cut-off events. For 18245/18362 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11538 event pairs, 552 based on Foata normal form. 22/2487 useless extension candidates. Maximal degree in co-relation 11895. Up to 2369 conditions per place. [2024-06-03 22:32:25,745 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 98 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-03 22:32:25,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1288 flow [2024-06-03 22:32:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 22:32:25,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 22:32:25,748 INFO L175 Difference]: Start difference. First operand has 88 places, 117 transitions, 980 flow. Second operand 6 states and 110 transitions. [2024-06-03 22:32:25,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1288 flow [2024-06-03 22:32:25,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1266 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-03 22:32:25,771 INFO L231 Difference]: Finished difference. Result has 93 places, 117 transitions, 1032 flow [2024-06-03 22:32:25,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1032, PETRI_PLACES=93, PETRI_TRANSITIONS=117} [2024-06-03 22:32:25,771 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-03 22:32:25,771 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 117 transitions, 1032 flow [2024-06-03 22:32:25,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:25,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:25,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:25,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:32:25,772 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-03 22:32:25,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash 484183663, now seen corresponding path program 3 times [2024-06-03 22:32:25,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086325936] [2024-06-03 22:32:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086325936] [2024-06-03 22:32:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086325936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363307351] [2024-06-03 22:32:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:31,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:31,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:31,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 117 transitions, 1032 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:31,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:31,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:31,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:32,624 INFO L124 PetriNetUnfolderBase]: 1754/2614 cut-off events. [2024-06-03 22:32:32,625 INFO L125 PetriNetUnfolderBase]: For 18352/18356 co-relation queries the response was YES. [2024-06-03 22:32:32,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12350 conditions, 2614 events. 1754/2614 cut-off events. For 18352/18356 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11851 event pairs, 611 based on Foata normal form. 10/2622 useless extension candidates. Maximal degree in co-relation 12304. Up to 2547 conditions per place. [2024-06-03 22:32:32,637 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 113 selfloop transitions, 21 changer transitions 0/137 dead transitions. [2024-06-03 22:32:32,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1391 flow [2024-06-03 22:32:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 22:32:32,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-03 22:32:32,638 INFO L175 Difference]: Start difference. First operand has 93 places, 117 transitions, 1032 flow. Second operand 6 states and 101 transitions. [2024-06-03 22:32:32,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1391 flow [2024-06-03 22:32:32,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 137 transitions, 1315 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:32,657 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 1067 flow [2024-06-03 22:32:32,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1067, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2024-06-03 22:32:32,658 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-03 22:32:32,658 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 1067 flow [2024-06-03 22:32:32,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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-03 22:32:32,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:32,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:32,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:32:32,659 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-03 22:32:32,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash 484192591, now seen corresponding path program 1 times [2024-06-03 22:32:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374885748] [2024-06-03 22:32:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374885748] [2024-06-03 22:32:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374885748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:40,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850809476] [2024-06-03 22:32:40,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:40,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:40,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:40,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:40,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:41,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:41,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 1067 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-03 22:32:41,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:41,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:41,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:42,072 INFO L124 PetriNetUnfolderBase]: 1754/2614 cut-off events. [2024-06-03 22:32:42,072 INFO L125 PetriNetUnfolderBase]: For 20776/20780 co-relation queries the response was YES. [2024-06-03 22:32:42,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12527 conditions, 2614 events. 1754/2614 cut-off events. For 20776/20780 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11830 event pairs, 592 based on Foata normal form. 10/2622 useless extension candidates. Maximal degree in co-relation 12480. Up to 2535 conditions per place. [2024-06-03 22:32:42,084 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 117 selfloop transitions, 20 changer transitions 0/140 dead transitions. [2024-06-03 22:32:42,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 140 transitions, 1413 flow [2024-06-03 22:32:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 22:32:42,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-03 22:32:42,086 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 1067 flow. Second operand 6 states and 101 transitions. [2024-06-03 22:32:42,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 140 transitions, 1413 flow [2024-06-03 22:32:42,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1355 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:42,105 INFO L231 Difference]: Finished difference. Result has 96 places, 124 transitions, 1095 flow [2024-06-03 22:32:42,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2024-06-03 22:32:42,106 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-03 22:32:42,106 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 124 transitions, 1095 flow [2024-06-03 22:32:42,106 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-03 22:32:42,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:42,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:42,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:32:42,106 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-03 22:32:42,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash -655734212, now seen corresponding path program 1 times [2024-06-03 22:32:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864222007] [2024-06-03 22:32:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864222007] [2024-06-03 22:32:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864222007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793972068] [2024-06-03 22:32:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:49,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:49,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:32:49,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 124 transitions, 1095 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:49,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:49,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:32:49,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:50,741 INFO L124 PetriNetUnfolderBase]: 1687/2534 cut-off events. [2024-06-03 22:32:50,742 INFO L125 PetriNetUnfolderBase]: For 26485/26650 co-relation queries the response was YES. [2024-06-03 22:32:50,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 2534 events. 1687/2534 cut-off events. For 26485/26650 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11646 event pairs, 531 based on Foata normal form. 52/2534 useless extension candidates. Maximal degree in co-relation 12901. Up to 2307 conditions per place. [2024-06-03 22:32:50,755 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 105 selfloop transitions, 50 changer transitions 0/168 dead transitions. [2024-06-03 22:32:50,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 168 transitions, 1617 flow [2024-06-03 22:32:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-03 22:32:50,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-03 22:32:50,758 INFO L175 Difference]: Start difference. First operand has 96 places, 124 transitions, 1095 flow. Second operand 9 states and 161 transitions. [2024-06-03 22:32:50,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 168 transitions, 1617 flow [2024-06-03 22:32:50,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 168 transitions, 1555 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:50,786 INFO L231 Difference]: Finished difference. Result has 101 places, 130 transitions, 1212 flow [2024-06-03 22:32:50,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=101, PETRI_TRANSITIONS=130} [2024-06-03 22:32:50,787 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-03 22:32:50,787 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 130 transitions, 1212 flow [2024-06-03 22:32:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:50,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:50,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:50,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:32:50,788 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-03 22:32:50,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -655643847, now seen corresponding path program 1 times [2024-06-03 22:32:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959160195] [2024-06-03 22:32:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959160195] [2024-06-03 22:32:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959160195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733536031] [2024-06-03 22:32:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:57,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:57,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:32:57,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 130 transitions, 1212 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:57,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:57,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:32:57,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:58,643 INFO L124 PetriNetUnfolderBase]: 1854/2756 cut-off events. [2024-06-03 22:32:58,643 INFO L125 PetriNetUnfolderBase]: For 28366/28370 co-relation queries the response was YES. [2024-06-03 22:32:58,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14286 conditions, 2756 events. 1854/2756 cut-off events. For 28366/28370 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12493 event pairs, 547 based on Foata normal form. 10/2764 useless extension candidates. Maximal degree in co-relation 14237. Up to 2434 conditions per place. [2024-06-03 22:32:58,658 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 125 selfloop transitions, 63 changer transitions 0/191 dead transitions. [2024-06-03 22:32:58,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 191 transitions, 1995 flow [2024-06-03 22:32:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-03 22:32:58,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-03 22:32:58,660 INFO L175 Difference]: Start difference. First operand has 101 places, 130 transitions, 1212 flow. Second operand 9 states and 161 transitions. [2024-06-03 22:32:58,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 191 transitions, 1995 flow [2024-06-03 22:32:58,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 191 transitions, 1901 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:58,685 INFO L231 Difference]: Finished difference. Result has 107 places, 149 transitions, 1510 flow [2024-06-03 22:32:58,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1510, PETRI_PLACES=107, PETRI_TRANSITIONS=149} [2024-06-03 22:32:58,685 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-03 22:32:58,686 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 149 transitions, 1510 flow [2024-06-03 22:32:58,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:58,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:58,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:32:58,686 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-03 22:32:58,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -651924777, now seen corresponding path program 2 times [2024-06-03 22:32:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011130025] [2024-06-03 22:32:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011130025] [2024-06-03 22:33:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011130025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29261151] [2024-06-03 22:33:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:05,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:05,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:05,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 149 transitions, 1510 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:05,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:05,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:05,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:06,394 INFO L124 PetriNetUnfolderBase]: 1934/2870 cut-off events. [2024-06-03 22:33:06,394 INFO L125 PetriNetUnfolderBase]: For 34034/34038 co-relation queries the response was YES. [2024-06-03 22:33:06,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15984 conditions, 2870 events. 1934/2870 cut-off events. For 34034/34038 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13031 event pairs, 562 based on Foata normal form. 10/2878 useless extension candidates. Maximal degree in co-relation 15931. Up to 2634 conditions per place. [2024-06-03 22:33:06,411 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 137 selfloop transitions, 56 changer transitions 0/196 dead transitions. [2024-06-03 22:33:06,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 2210 flow [2024-06-03 22:33:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:33:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:33:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-03 22:33:06,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 22:33:06,412 INFO L175 Difference]: Start difference. First operand has 107 places, 149 transitions, 1510 flow. Second operand 9 states and 159 transitions. [2024-06-03 22:33:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 196 transitions, 2210 flow [2024-06-03 22:33:06,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 196 transitions, 2096 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-03 22:33:06,449 INFO L231 Difference]: Finished difference. Result has 113 places, 158 transitions, 1656 flow [2024-06-03 22:33:06,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1656, PETRI_PLACES=113, PETRI_TRANSITIONS=158} [2024-06-03 22:33:06,450 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 22:33:06,450 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 158 transitions, 1656 flow [2024-06-03 22:33:06,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:06,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:06,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:06,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:33:06,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:33:06,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -651924932, now seen corresponding path program 2 times [2024-06-03 22:33:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058630045] [2024-06-03 22:33:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058630045] [2024-06-03 22:33:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058630045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:13,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:13,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575664386] [2024-06-03 22:33:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:13,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:13,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:33:13,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 158 transitions, 1656 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:13,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:13,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:33:13,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:15,023 INFO L124 PetriNetUnfolderBase]: 1901/2836 cut-off events. [2024-06-03 22:33:15,023 INFO L125 PetriNetUnfolderBase]: For 42906/43081 co-relation queries the response was YES. [2024-06-03 22:33:15,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16712 conditions, 2836 events. 1901/2836 cut-off events. For 42906/43081 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13121 event pairs, 537 based on Foata normal form. 11/2794 useless extension candidates. Maximal degree in co-relation 16656. Up to 2663 conditions per place. [2024-06-03 22:33:15,039 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 129 selfloop transitions, 40 changer transitions 0/187 dead transitions. [2024-06-03 22:33:15,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 187 transitions, 2094 flow [2024-06-03 22:33:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:33:15,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:33:15,042 INFO L175 Difference]: Start difference. First operand has 113 places, 158 transitions, 1656 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:33:15,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 187 transitions, 2094 flow [2024-06-03 22:33:15,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 187 transitions, 2006 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-03 22:33:15,084 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 1697 flow [2024-06-03 22:33:15,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1697, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2024-06-03 22:33:15,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-03 22:33:15,085 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1697 flow [2024-06-03 22:33:15,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:15,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:15,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:15,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:33:15,085 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-03 22:33:15,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -651919197, now seen corresponding path program 3 times [2024-06-03 22:33:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483139190] [2024-06-03 22:33:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:21,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-03 22:33:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483139190] [2024-06-03 22:33:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483139190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776232058] [2024-06-03 22:33:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:21,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:21,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1697 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:21,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:21,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:21,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:22,862 INFO L124 PetriNetUnfolderBase]: 1934/2871 cut-off events. [2024-06-03 22:33:22,863 INFO L125 PetriNetUnfolderBase]: For 39562/39566 co-relation queries the response was YES. [2024-06-03 22:33:22,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16530 conditions, 2871 events. 1934/2871 cut-off events. For 39562/39566 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13053 event pairs, 560 based on Foata normal form. 10/2879 useless extension candidates. Maximal degree in co-relation 16472. Up to 2644 conditions per place. [2024-06-03 22:33:22,881 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 144 selfloop transitions, 59 changer transitions 0/206 dead transitions. [2024-06-03 22:33:22,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 206 transitions, 2273 flow [2024-06-03 22:33:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:33:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:33:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-03 22:33:22,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41019955654101997 [2024-06-03 22:33:22,882 INFO L175 Difference]: Start difference. First operand has 116 places, 161 transitions, 1697 flow. Second operand 11 states and 185 transitions. [2024-06-03 22:33:22,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 206 transitions, 2273 flow [2024-06-03 22:33:22,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 206 transitions, 2152 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:22,926 INFO L231 Difference]: Finished difference. Result has 121 places, 162 transitions, 1718 flow [2024-06-03 22:33:22,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1718, PETRI_PLACES=121, PETRI_TRANSITIONS=162} [2024-06-03 22:33:22,926 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-03 22:33:22,926 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 162 transitions, 1718 flow [2024-06-03 22:33:22,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:22,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:22,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:22,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:33:22,927 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-03 22:33:22,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2125059486, now seen corresponding path program 1 times [2024-06-03 22:33:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471501887] [2024-06-03 22:33:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471501887] [2024-06-03 22:33:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471501887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757734469] [2024-06-03 22:33:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:29,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:29,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 162 transitions, 1718 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:29,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:29,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:29,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:30,507 INFO L124 PetriNetUnfolderBase]: 1934/2871 cut-off events. [2024-06-03 22:33:30,507 INFO L125 PetriNetUnfolderBase]: For 43059/43063 co-relation queries the response was YES. [2024-06-03 22:33:30,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16807 conditions, 2871 events. 1934/2871 cut-off events. For 43059/43063 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13120 event pairs, 574 based on Foata normal form. 7/2876 useless extension candidates. Maximal degree in co-relation 16748. Up to 2780 conditions per place. [2024-06-03 22:33:30,525 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 152 selfloop transitions, 27 changer transitions 0/182 dead transitions. [2024-06-03 22:33:30,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 2168 flow [2024-06-03 22:33:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:33:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:33:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:33:30,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:33:30,527 INFO L175 Difference]: Start difference. First operand has 121 places, 162 transitions, 1718 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:33:30,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 2168 flow [2024-06-03 22:33:30,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 2042 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:33:30,572 INFO L231 Difference]: Finished difference. Result has 118 places, 166 transitions, 1721 flow [2024-06-03 22:33:30,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1721, PETRI_PLACES=118, PETRI_TRANSITIONS=166} [2024-06-03 22:33:30,573 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 22:33:30,573 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 166 transitions, 1721 flow [2024-06-03 22:33:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:30,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:30,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:33:30,574 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-03 22:33:30,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2124792359, now seen corresponding path program 4 times [2024-06-03 22:33:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423938228] [2024-06-03 22:33:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423938228] [2024-06-03 22:33:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423938228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955206735] [2024-06-03 22:33:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:36,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:37,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:37,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 166 transitions, 1721 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:37,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:37,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:37,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:38,079 INFO L124 PetriNetUnfolderBase]: 1966/2917 cut-off events. [2024-06-03 22:33:38,079 INFO L125 PetriNetUnfolderBase]: For 47956/47960 co-relation queries the response was YES. [2024-06-03 22:33:38,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 2917 events. 1966/2917 cut-off events. For 47956/47960 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13316 event pairs, 574 based on Foata normal form. 10/2925 useless extension candidates. Maximal degree in co-relation 17471. Up to 2819 conditions per place. [2024-06-03 22:33:38,097 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 163 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-06-03 22:33:38,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 191 transitions, 2211 flow [2024-06-03 22:33:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 22:33:38,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 22:33:38,098 INFO L175 Difference]: Start difference. First operand has 118 places, 166 transitions, 1721 flow. Second operand 7 states and 117 transitions. [2024-06-03 22:33:38,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 191 transitions, 2211 flow [2024-06-03 22:33:38,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 191 transitions, 2142 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 22:33:38,147 INFO L231 Difference]: Finished difference. Result has 121 places, 170 transitions, 1778 flow [2024-06-03 22:33:38,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1778, PETRI_PLACES=121, PETRI_TRANSITIONS=170} [2024-06-03 22:33:38,148 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-03 22:33:38,148 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 170 transitions, 1778 flow [2024-06-03 22:33:38,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:38,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:38,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:33:38,148 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-03 22:33:38,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2117435129, now seen corresponding path program 5 times [2024-06-03 22:33:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699688982] [2024-06-03 22:33:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699688982] [2024-06-03 22:33:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699688982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373740332] [2024-06-03 22:33:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:44,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:44,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:44,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:33:44,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 170 transitions, 1778 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:44,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:44,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:33:44,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:45,862 INFO L124 PetriNetUnfolderBase]: 1998/2963 cut-off events. [2024-06-03 22:33:45,862 INFO L125 PetriNetUnfolderBase]: For 52715/52719 co-relation queries the response was YES. [2024-06-03 22:33:45,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18109 conditions, 2963 events. 1998/2963 cut-off events. For 52715/52719 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13540 event pairs, 571 based on Foata normal form. 10/2971 useless extension candidates. Maximal degree in co-relation 18048. Up to 2712 conditions per place. [2024-06-03 22:33:45,878 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 155 selfloop transitions, 53 changer transitions 0/211 dead transitions. [2024-06-03 22:33:45,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 211 transitions, 2486 flow [2024-06-03 22:33:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:33:45,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:33:45,880 INFO L175 Difference]: Start difference. First operand has 121 places, 170 transitions, 1778 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:33:45,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 211 transitions, 2486 flow [2024-06-03 22:33:45,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 211 transitions, 2404 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-03 22:33:45,933 INFO L231 Difference]: Finished difference. Result has 125 places, 175 transitions, 1907 flow [2024-06-03 22:33:45,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1907, PETRI_PLACES=125, PETRI_TRANSITIONS=175} [2024-06-03 22:33:45,933 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 22:33:45,934 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 175 transitions, 1907 flow [2024-06-03 22:33:45,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:45,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:45,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:33:45,934 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-03 22:33:45,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2117434974, now seen corresponding path program 3 times [2024-06-03 22:33:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605426611] [2024-06-03 22:33:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:52,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:52,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605426611] [2024-06-03 22:33:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605426611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84202603] [2024-06-03 22:33:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:52,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:33:52,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 175 transitions, 1907 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:52,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:52,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:33:52,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:54,054 INFO L124 PetriNetUnfolderBase]: 1935/2889 cut-off events. [2024-06-03 22:33:54,054 INFO L125 PetriNetUnfolderBase]: For 63415/63607 co-relation queries the response was YES. [2024-06-03 22:33:54,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18637 conditions, 2889 events. 1935/2889 cut-off events. For 63415/63607 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13424 event pairs, 534 based on Foata normal form. 20/2852 useless extension candidates. Maximal degree in co-relation 18574. Up to 2685 conditions per place. [2024-06-03 22:33:54,073 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 140 selfloop transitions, 41 changer transitions 0/203 dead transitions. [2024-06-03 22:33:54,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 203 transitions, 2341 flow [2024-06-03 22:33:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 22:33:54,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 22:33:54,076 INFO L175 Difference]: Start difference. First operand has 125 places, 175 transitions, 1907 flow. Second operand 7 states and 129 transitions. [2024-06-03 22:33:54,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 203 transitions, 2341 flow [2024-06-03 22:33:54,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 203 transitions, 2113 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:54,139 INFO L231 Difference]: Finished difference. Result has 125 places, 175 transitions, 1775 flow [2024-06-03 22:33:54,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1775, PETRI_PLACES=125, PETRI_TRANSITIONS=175} [2024-06-03 22:33:54,139 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 22:33:54,139 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 175 transitions, 1775 flow [2024-06-03 22:33:54,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:54,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:54,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:33:54,140 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-03 22:33:54,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2117440709, now seen corresponding path program 6 times [2024-06-03 22:33:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:54,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547102983] [2024-06-03 22:33:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:00,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:00,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547102983] [2024-06-03 22:34:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547102983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:00,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:34:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742943676] [2024-06-03 22:34:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:00,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:34:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:34:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:34:00,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:00,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 175 transitions, 1775 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:00,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:00,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:00,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:01,942 INFO L124 PetriNetUnfolderBase]: 1978/2936 cut-off events. [2024-06-03 22:34:01,942 INFO L125 PetriNetUnfolderBase]: For 58990/58994 co-relation queries the response was YES. [2024-06-03 22:34:01,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17906 conditions, 2936 events. 1978/2936 cut-off events. For 58990/58994 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13400 event pairs, 577 based on Foata normal form. 10/2944 useless extension candidates. Maximal degree in co-relation 17843. Up to 2693 conditions per place. [2024-06-03 22:34:01,960 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 154 selfloop transitions, 50 changer transitions 0/207 dead transitions. [2024-06-03 22:34:01,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 207 transitions, 2329 flow [2024-06-03 22:34:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:34:01,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:34:01,962 INFO L175 Difference]: Start difference. First operand has 125 places, 175 transitions, 1775 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:34:01,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 207 transitions, 2329 flow [2024-06-03 22:34:02,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 207 transitions, 2210 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:02,019 INFO L231 Difference]: Finished difference. Result has 128 places, 177 transitions, 1817 flow [2024-06-03 22:34:02,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1817, PETRI_PLACES=128, PETRI_TRANSITIONS=177} [2024-06-03 22:34:02,019 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-03 22:34:02,019 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 177 transitions, 1817 flow [2024-06-03 22:34:02,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:02,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:02,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:02,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:34:02,020 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:02,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1473524437, now seen corresponding path program 1 times [2024-06-03 22:34:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593103551] [2024-06-03 22:34:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593103551] [2024-06-03 22:34:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593103551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:34:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752809711] [2024-06-03 22:34:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:12,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:34:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:34:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:34:12,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:34:12,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 177 transitions, 1817 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-03 22:34:12,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:12,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:34:12,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:13,793 INFO L124 PetriNetUnfolderBase]: 1903/2845 cut-off events. [2024-06-03 22:34:13,793 INFO L125 PetriNetUnfolderBase]: For 62818/62827 co-relation queries the response was YES. [2024-06-03 22:34:13,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17848 conditions, 2845 events. 1903/2845 cut-off events. For 62818/62827 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13034 event pairs, 561 based on Foata normal form. 13/2846 useless extension candidates. Maximal degree in co-relation 17783. Up to 2745 conditions per place. [2024-06-03 22:34:13,812 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 160 selfloop transitions, 14 changer transitions 0/189 dead transitions. [2024-06-03 22:34:13,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 2211 flow [2024-06-03 22:34:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:34:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:34:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-03 22:34:13,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097560975609756 [2024-06-03 22:34:13,813 INFO L175 Difference]: Start difference. First operand has 128 places, 177 transitions, 1817 flow. Second operand 5 states and 84 transitions. [2024-06-03 22:34:13,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 2211 flow [2024-06-03 22:34:13,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 189 transitions, 2131 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 22:34:13,881 INFO L231 Difference]: Finished difference. Result has 129 places, 180 transitions, 1804 flow [2024-06-03 22:34:13,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1737, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1804, PETRI_PLACES=129, PETRI_TRANSITIONS=180} [2024-06-03 22:34:13,882 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-03 22:34:13,882 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 180 transitions, 1804 flow [2024-06-03 22:34:13,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-03 22:34:13,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:13,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:13,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:34:13,882 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-03 22:34:13,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1341313866, now seen corresponding path program 1 times [2024-06-03 22:34:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416958017] [2024-06-03 22:34:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416958017] [2024-06-03 22:34:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416958017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235989687] [2024-06-03 22:34:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:21,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:21,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:34:21,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 180 transitions, 1804 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:34:21,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:22,568 INFO L124 PetriNetUnfolderBase]: 1928/2884 cut-off events. [2024-06-03 22:34:22,568 INFO L125 PetriNetUnfolderBase]: For 75864/76084 co-relation queries the response was YES. [2024-06-03 22:34:22,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18744 conditions, 2884 events. 1928/2884 cut-off events. For 75864/76084 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13422 event pairs, 388 based on Foata normal form. 21/2848 useless extension candidates. Maximal degree in co-relation 18678. Up to 2511 conditions per place. [2024-06-03 22:34:22,583 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 132 selfloop transitions, 69 changer transitions 0/224 dead transitions. [2024-06-03 22:34:22,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 224 transitions, 2476 flow [2024-06-03 22:34:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:34:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:34:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-03 22:34:22,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:34:22,585 INFO L175 Difference]: Start difference. First operand has 129 places, 180 transitions, 1804 flow. Second operand 9 states and 162 transitions. [2024-06-03 22:34:22,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 224 transitions, 2476 flow [2024-06-03 22:34:22,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 224 transitions, 2439 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 22:34:22,641 INFO L231 Difference]: Finished difference. Result has 135 places, 184 transitions, 1992 flow [2024-06-03 22:34:22,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1992, PETRI_PLACES=135, PETRI_TRANSITIONS=184} [2024-06-03 22:34:22,641 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-03 22:34:22,641 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 184 transitions, 1992 flow [2024-06-03 22:34:22,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:22,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:22,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:34:22,642 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-03 22:34:22,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1341253292, now seen corresponding path program 1 times [2024-06-03 22:34:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276397827] [2024-06-03 22:34:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276397827] [2024-06-03 22:34:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276397827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210786490] [2024-06-03 22:34:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:30,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:30,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:30,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 184 transitions, 1992 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-03 22:34:30,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:30,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:30,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:31,976 INFO L124 PetriNetUnfolderBase]: 2075/3078 cut-off events. [2024-06-03 22:34:31,977 INFO L125 PetriNetUnfolderBase]: For 74824/74828 co-relation queries the response was YES. [2024-06-03 22:34:31,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19857 conditions, 3078 events. 2075/3078 cut-off events. For 74824/74828 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14179 event pairs, 468 based on Foata normal form. 10/3086 useless extension candidates. Maximal degree in co-relation 19790. Up to 2485 conditions per place. [2024-06-03 22:34:31,993 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 158 selfloop transitions, 100 changer transitions 0/261 dead transitions. [2024-06-03 22:34:31,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 261 transitions, 3050 flow [2024-06-03 22:34:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:34:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:34:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-06-03 22:34:31,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-03 22:34:31,995 INFO L175 Difference]: Start difference. First operand has 135 places, 184 transitions, 1992 flow. Second operand 12 states and 213 transitions. [2024-06-03 22:34:31,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 261 transitions, 3050 flow [2024-06-03 22:34:32,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 261 transitions, 2922 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 22:34:32,068 INFO L231 Difference]: Finished difference. Result has 144 places, 203 transitions, 2361 flow [2024-06-03 22:34:32,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2361, PETRI_PLACES=144, PETRI_TRANSITIONS=203} [2024-06-03 22:34:32,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-03 22:34:32,068 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 203 transitions, 2361 flow [2024-06-03 22:34:32,069 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-03 22:34:32,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:32,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:32,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:34:32,069 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-03 22:34:32,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1147076664, now seen corresponding path program 2 times [2024-06-03 22:34:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908452879] [2024-06-03 22:34:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:39,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908452879] [2024-06-03 22:34:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908452879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:39,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:39,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856833776] [2024-06-03 22:34:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:39,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:39,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:39,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:39,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:34:39,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 203 transitions, 2361 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:39,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:39,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:34:39,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:40,646 INFO L124 PetriNetUnfolderBase]: 2032/3035 cut-off events. [2024-06-03 22:34:40,646 INFO L125 PetriNetUnfolderBase]: For 90796/90932 co-relation queries the response was YES. [2024-06-03 22:34:40,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21170 conditions, 3035 events. 2032/3035 cut-off events. For 90796/90932 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14213 event pairs, 498 based on Foata normal form. 9/2986 useless extension candidates. Maximal degree in co-relation 21099. Up to 2713 conditions per place. [2024-06-03 22:34:40,667 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 142 selfloop transitions, 78 changer transitions 0/246 dead transitions. [2024-06-03 22:34:40,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 246 transitions, 2939 flow [2024-06-03 22:34:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:34:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:34:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-03 22:34:40,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-03 22:34:40,669 INFO L175 Difference]: Start difference. First operand has 144 places, 203 transitions, 2361 flow. Second operand 10 states and 174 transitions. [2024-06-03 22:34:40,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 246 transitions, 2939 flow [2024-06-03 22:34:40,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 246 transitions, 2754 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-03 22:34:40,755 INFO L231 Difference]: Finished difference. Result has 147 places, 205 transitions, 2378 flow [2024-06-03 22:34:40,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2378, PETRI_PLACES=147, PETRI_TRANSITIONS=205} [2024-06-03 22:34:40,755 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-03 22:34:40,755 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 205 transitions, 2378 flow [2024-06-03 22:34:40,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:40,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:40,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:34:40,756 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-03 22:34:40,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1265169118, now seen corresponding path program 2 times [2024-06-03 22:34:40,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768695469] [2024-06-03 22:34:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768695469] [2024-06-03 22:34:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768695469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:48,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52554121] [2024-06-03 22:34:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:48,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:48,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:48,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 205 transitions, 2378 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-03 22:34:48,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:48,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:49,661 INFO L124 PetriNetUnfolderBase]: 2132/3163 cut-off events. [2024-06-03 22:34:49,661 INFO L125 PetriNetUnfolderBase]: For 86244/86248 co-relation queries the response was YES. [2024-06-03 22:34:49,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21572 conditions, 3163 events. 2132/3163 cut-off events. For 86244/86248 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14615 event pairs, 500 based on Foata normal form. 10/3171 useless extension candidates. Maximal degree in co-relation 21499. Up to 2905 conditions per place. [2024-06-03 22:34:49,682 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 185 selfloop transitions, 61 changer transitions 0/249 dead transitions. [2024-06-03 22:34:49,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 249 transitions, 3086 flow [2024-06-03 22:34:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:34:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:34:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-03 22:34:49,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219512195121951 [2024-06-03 22:34:49,683 INFO L175 Difference]: Start difference. First operand has 147 places, 205 transitions, 2378 flow. Second operand 10 states and 173 transitions. [2024-06-03 22:34:49,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 249 transitions, 3086 flow [2024-06-03 22:34:49,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 249 transitions, 2908 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 22:34:49,783 INFO L231 Difference]: Finished difference. Result has 149 places, 209 transitions, 2393 flow [2024-06-03 22:34:49,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2393, PETRI_PLACES=149, PETRI_TRANSITIONS=209} [2024-06-03 22:34:49,783 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-03 22:34:49,783 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 209 transitions, 2393 flow [2024-06-03 22:34:49,784 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-03 22:34:49,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:49,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:49,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:34:49,784 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:34:49,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1265342098, now seen corresponding path program 3 times [2024-06-03 22:34:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80083108] [2024-06-03 22:34:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80083108] [2024-06-03 22:34:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80083108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054729293] [2024-06-03 22:34:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:57,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:57,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:34:57,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 209 transitions, 2393 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-03 22:34:57,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:57,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:34:57,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:58,979 INFO L124 PetriNetUnfolderBase]: 2164/3209 cut-off events. [2024-06-03 22:34:58,980 INFO L125 PetriNetUnfolderBase]: For 92787/92791 co-relation queries the response was YES. [2024-06-03 22:34:58,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22079 conditions, 3209 events. 2164/3209 cut-off events. For 92787/92791 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14851 event pairs, 502 based on Foata normal form. 10/3217 useless extension candidates. Maximal degree in co-relation 22005. Up to 2951 conditions per place. [2024-06-03 22:34:59,002 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 195 selfloop transitions, 63 changer transitions 0/261 dead transitions. [2024-06-03 22:34:59,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 261 transitions, 3155 flow [2024-06-03 22:34:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:34:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:34:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2024-06-03 22:34:59,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-03 22:34:59,003 INFO L175 Difference]: Start difference. First operand has 149 places, 209 transitions, 2393 flow. Second operand 12 states and 201 transitions. [2024-06-03 22:34:59,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 261 transitions, 3155 flow [2024-06-03 22:34:59,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 261 transitions, 3004 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 22:34:59,097 INFO L231 Difference]: Finished difference. Result has 153 places, 213 transitions, 2447 flow [2024-06-03 22:34:59,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2447, PETRI_PLACES=153, PETRI_TRANSITIONS=213} [2024-06-03 22:34:59,098 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-03 22:34:59,098 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 213 transitions, 2447 flow [2024-06-03 22:34:59,098 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-03 22:34:59,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:59,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:59,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:34:59,099 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-03 22:34:59,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1265164344, now seen corresponding path program 3 times [2024-06-03 22:34:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35397082] [2024-06-03 22:34:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:04,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35397082] [2024-06-03 22:35:04,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35397082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181682299] [2024-06-03 22:35:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:04,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:05,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:35:05,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 213 transitions, 2447 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:05,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:05,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:35:05,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:06,493 INFO L124 PetriNetUnfolderBase]: 2217/3308 cut-off events. [2024-06-03 22:35:06,493 INFO L125 PetriNetUnfolderBase]: For 119035/119214 co-relation queries the response was YES. [2024-06-03 22:35:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23510 conditions, 3308 events. 2217/3308 cut-off events. For 119035/119214 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15728 event pairs, 517 based on Foata normal form. 32/3279 useless extension candidates. Maximal degree in co-relation 23435. Up to 2934 conditions per place. [2024-06-03 22:35:06,513 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 187 selfloop transitions, 56 changer transitions 0/271 dead transitions. [2024-06-03 22:35:06,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 271 transitions, 3389 flow [2024-06-03 22:35:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 22:35:06,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-03 22:35:06,514 INFO L175 Difference]: Start difference. First operand has 153 places, 213 transitions, 2447 flow. Second operand 9 states and 169 transitions. [2024-06-03 22:35:06,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 271 transitions, 3389 flow [2024-06-03 22:35:06,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 271 transitions, 3226 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-03 22:35:06,607 INFO L231 Difference]: Finished difference. Result has 154 places, 229 transitions, 2623 flow [2024-06-03 22:35:06,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2623, PETRI_PLACES=154, PETRI_TRANSITIONS=229} [2024-06-03 22:35:06,607 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-03 22:35:06,607 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 229 transitions, 2623 flow [2024-06-03 22:35:06,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:06,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:06,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:06,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:35:06,608 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-03 22:35:06,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1265349042, now seen corresponding path program 1 times [2024-06-03 22:35:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:06,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18069903] [2024-06-03 22:35:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18069903] [2024-06-03 22:35:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18069903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561093677] [2024-06-03 22:35:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:13,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:13,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 229 transitions, 2623 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-03 22:35:13,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:14,505 INFO L124 PetriNetUnfolderBase]: 2301/3418 cut-off events. [2024-06-03 22:35:14,505 INFO L125 PetriNetUnfolderBase]: For 114221/114225 co-relation queries the response was YES. [2024-06-03 22:35:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24322 conditions, 3418 events. 2301/3418 cut-off events. For 114221/114225 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16061 event pairs, 535 based on Foata normal form. 5/3421 useless extension candidates. Maximal degree in co-relation 24244. Up to 3281 conditions per place. [2024-06-03 22:35:14,528 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 234 selfloop transitions, 26 changer transitions 0/263 dead transitions. [2024-06-03 22:35:14,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 263 transitions, 3284 flow [2024-06-03 22:35:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 22:35:14,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-03 22:35:14,530 INFO L175 Difference]: Start difference. First operand has 154 places, 229 transitions, 2623 flow. Second operand 8 states and 133 transitions. [2024-06-03 22:35:14,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 263 transitions, 3284 flow [2024-06-03 22:35:14,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 263 transitions, 3214 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-03 22:35:14,656 INFO L231 Difference]: Finished difference. Result has 161 places, 232 transitions, 2676 flow [2024-06-03 22:35:14,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2676, PETRI_PLACES=161, PETRI_TRANSITIONS=232} [2024-06-03 22:35:14,657 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-03 22:35:14,657 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 232 transitions, 2676 flow [2024-06-03 22:35:14,657 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-03 22:35:14,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:14,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:14,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:35:14,658 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-03 22:35:14,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1265164468, now seen corresponding path program 4 times [2024-06-03 22:35:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798883046] [2024-06-03 22:35:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798883046] [2024-06-03 22:35:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798883046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147198656] [2024-06-03 22:35:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:21,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:21,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:21,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 232 transitions, 2676 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-03 22:35:21,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:21,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:21,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:22,817 INFO L124 PetriNetUnfolderBase]: 2323/3450 cut-off events. [2024-06-03 22:35:22,818 INFO L125 PetriNetUnfolderBase]: For 119804/119808 co-relation queries the response was YES. [2024-06-03 22:35:22,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 3450 events. 2323/3450 cut-off events. For 119804/119808 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16234 event pairs, 534 based on Foata normal form. 5/3453 useless extension candidates. Maximal degree in co-relation 24657. Up to 3190 conditions per place. [2024-06-03 22:35:22,843 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 238 selfloop transitions, 48 changer transitions 0/289 dead transitions. [2024-06-03 22:35:22,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 289 transitions, 3565 flow [2024-06-03 22:35:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-03 22:35:22,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-03 22:35:22,846 INFO L175 Difference]: Start difference. First operand has 161 places, 232 transitions, 2676 flow. Second operand 9 states and 154 transitions. [2024-06-03 22:35:22,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 289 transitions, 3565 flow [2024-06-03 22:35:22,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 289 transitions, 3517 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 22:35:22,958 INFO L231 Difference]: Finished difference. Result has 171 places, 251 transitions, 3003 flow [2024-06-03 22:35:22,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2628, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3003, PETRI_PLACES=171, PETRI_TRANSITIONS=251} [2024-06-03 22:35:22,958 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-03 22:35:22,958 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 3003 flow [2024-06-03 22:35:22,959 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-03 22:35:22,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:22,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:35:22,959 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-03 22:35:22,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1444061358, now seen corresponding path program 2 times [2024-06-03 22:35:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096664722] [2024-06-03 22:35:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:29,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096664722] [2024-06-03 22:35:29,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096664722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:29,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:29,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098523359] [2024-06-03 22:35:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:29,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:29,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 3003 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-03 22:35:29,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:29,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:29,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:30,569 INFO L124 PetriNetUnfolderBase]: 2340/3477 cut-off events. [2024-06-03 22:35:30,569 INFO L125 PetriNetUnfolderBase]: For 128181/128185 co-relation queries the response was YES. [2024-06-03 22:35:30,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25478 conditions, 3477 events. 2340/3477 cut-off events. For 128181/128185 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16371 event pairs, 573 based on Foata normal form. 8/3483 useless extension candidates. Maximal degree in co-relation 25392. Up to 3409 conditions per place. [2024-06-03 22:35:30,595 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 14 changer transitions 0/276 dead transitions. [2024-06-03 22:35:30,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 276 transitions, 3651 flow [2024-06-03 22:35:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:35:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:35:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-03 22:35:30,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:35:30,598 INFO L175 Difference]: Start difference. First operand has 171 places, 251 transitions, 3003 flow. Second operand 7 states and 112 transitions. [2024-06-03 22:35:30,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 276 transitions, 3651 flow [2024-06-03 22:35:30,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 276 transitions, 3611 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-03 22:35:30,743 INFO L231 Difference]: Finished difference. Result has 177 places, 254 transitions, 3049 flow [2024-06-03 22:35:30,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3049, PETRI_PLACES=177, PETRI_TRANSITIONS=254} [2024-06-03 22:35:30,744 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-03 22:35:30,744 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 254 transitions, 3049 flow [2024-06-03 22:35:30,744 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-03 22:35:30,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:30,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:35:30,744 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-03 22:35:30,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1444054414, now seen corresponding path program 5 times [2024-06-03 22:35:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925034660] [2024-06-03 22:35:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925034660] [2024-06-03 22:35:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925034660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033412414] [2024-06-03 22:35:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:37,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:37,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:37,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 254 transitions, 3049 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-03 22:35:37,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:37,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:37,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:39,246 INFO L124 PetriNetUnfolderBase]: 2372/3523 cut-off events. [2024-06-03 22:35:39,247 INFO L125 PetriNetUnfolderBase]: For 137567/137571 co-relation queries the response was YES. [2024-06-03 22:35:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26204 conditions, 3523 events. 2372/3523 cut-off events. For 137567/137571 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16687 event pairs, 565 based on Foata normal form. 10/3531 useless extension candidates. Maximal degree in co-relation 26114. Up to 3394 conditions per place. [2024-06-03 22:35:39,271 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 251 selfloop transitions, 30 changer transitions 0/284 dead transitions. [2024-06-03 22:35:39,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 3757 flow [2024-06-03 22:35:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 22:35:39,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-03 22:35:39,272 INFO L175 Difference]: Start difference. First operand has 177 places, 254 transitions, 3049 flow. Second operand 8 states and 133 transitions. [2024-06-03 22:35:39,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 3757 flow [2024-06-03 22:35:39,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 284 transitions, 3704 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 22:35:39,417 INFO L231 Difference]: Finished difference. Result has 182 places, 258 transitions, 3149 flow [2024-06-03 22:35:39,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3149, PETRI_PLACES=182, PETRI_TRANSITIONS=258} [2024-06-03 22:35:39,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-03 22:35:39,418 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 258 transitions, 3149 flow [2024-06-03 22:35:39,418 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-03 22:35:39,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:39,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:39,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:35:39,418 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-03 22:35:39,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1215975510, now seen corresponding path program 4 times [2024-06-03 22:35:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863183405] [2024-06-03 22:35:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863183405] [2024-06-03 22:35:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863183405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:45,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:45,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630244945] [2024-06-03 22:35:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:45,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:35:45,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 258 transitions, 3149 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:45,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:45,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:35:45,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:47,242 INFO L124 PetriNetUnfolderBase]: 2289/3418 cut-off events. [2024-06-03 22:35:47,242 INFO L125 PetriNetUnfolderBase]: For 157148/157353 co-relation queries the response was YES. [2024-06-03 22:35:47,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26354 conditions, 3418 events. 2289/3418 cut-off events. For 157148/157353 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16375 event pairs, 423 based on Foata normal form. 27/3385 useless extension candidates. Maximal degree in co-relation 26263. Up to 3125 conditions per place. [2024-06-03 22:35:47,267 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 205 selfloop transitions, 53 changer transitions 0/291 dead transitions. [2024-06-03 22:35:47,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 291 transitions, 3749 flow [2024-06-03 22:35:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:35:47,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:35:47,270 INFO L175 Difference]: Start difference. First operand has 182 places, 258 transitions, 3149 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:35:47,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 291 transitions, 3749 flow [2024-06-03 22:35:47,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 291 transitions, 3622 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:47,422 INFO L231 Difference]: Finished difference. Result has 184 places, 258 transitions, 3140 flow [2024-06-03 22:35:47,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3022, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3140, PETRI_PLACES=184, PETRI_TRANSITIONS=258} [2024-06-03 22:35:47,423 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-03 22:35:47,423 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 258 transitions, 3140 flow [2024-06-03 22:35:47,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:47,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:47,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:47,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:35:47,423 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-03 22:35:47,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1452632238, now seen corresponding path program 3 times [2024-06-03 22:35:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:47,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363699172] [2024-06-03 22:35:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363699172] [2024-06-03 22:35:54,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363699172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:54,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129521607] [2024-06-03 22:35:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:54,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:35:54,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 258 transitions, 3140 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-03 22:35:54,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:54,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:35:54,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:55,347 INFO L124 PetriNetUnfolderBase]: 2384/3543 cut-off events. [2024-06-03 22:35:55,347 INFO L125 PetriNetUnfolderBase]: For 148797/148801 co-relation queries the response was YES. [2024-06-03 22:35:55,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26509 conditions, 3543 events. 2384/3543 cut-off events. For 148797/148801 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16736 event pairs, 564 based on Foata normal form. 10/3551 useless extension candidates. Maximal degree in co-relation 26417. Up to 3433 conditions per place. [2024-06-03 22:35:55,375 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 253 selfloop transitions, 26 changer transitions 0/282 dead transitions. [2024-06-03 22:35:55,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 282 transitions, 3812 flow [2024-06-03 22:35:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:35:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:35:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:35:55,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:35:55,377 INFO L175 Difference]: Start difference. First operand has 184 places, 258 transitions, 3140 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:35:55,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 282 transitions, 3812 flow [2024-06-03 22:35:55,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 282 transitions, 3706 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:55,539 INFO L231 Difference]: Finished difference. Result has 185 places, 261 transitions, 3162 flow [2024-06-03 22:35:55,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3162, PETRI_PLACES=185, PETRI_TRANSITIONS=261} [2024-06-03 22:35:55,539 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-03 22:35:55,540 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 261 transitions, 3162 flow [2024-06-03 22:35:55,540 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-03 22:35:55,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:55,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:55,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:35:55,540 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:35:55,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1216160208, now seen corresponding path program 4 times [2024-06-03 22:35:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777029844] [2024-06-03 22:35:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:02,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777029844] [2024-06-03 22:36:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777029844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:02,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:36:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020517814] [2024-06-03 22:36:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:02,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:36:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:02,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:36:02,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:36:02,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:02,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 261 transitions, 3162 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-03 22:36:02,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:02,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:02,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:03,818 INFO L124 PetriNetUnfolderBase]: 2399/3568 cut-off events. [2024-06-03 22:36:03,819 INFO L125 PetriNetUnfolderBase]: For 157138/157142 co-relation queries the response was YES. [2024-06-03 22:36:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26951 conditions, 3568 events. 2399/3568 cut-off events. For 157138/157142 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16973 event pairs, 531 based on Foata normal form. 12/3578 useless extension candidates. Maximal degree in co-relation 26858. Up to 3367 conditions per place. [2024-06-03 22:36:03,910 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 236 selfloop transitions, 54 changer transitions 0/293 dead transitions. [2024-06-03 22:36:03,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 293 transitions, 3886 flow [2024-06-03 22:36:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:36:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:36:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:36:03,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:36:03,912 INFO L175 Difference]: Start difference. First operand has 185 places, 261 transitions, 3162 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:36:03,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 293 transitions, 3886 flow [2024-06-03 22:36:04,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 293 transitions, 3760 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-03 22:36:04,077 INFO L231 Difference]: Finished difference. Result has 189 places, 264 transitions, 3249 flow [2024-06-03 22:36:04,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3036, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3249, PETRI_PLACES=189, PETRI_TRANSITIONS=264} [2024-06-03 22:36:04,078 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-03 22:36:04,078 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 264 transitions, 3249 flow [2024-06-03 22:36:04,078 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-03 22:36:04,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:04,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:04,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:36:04,078 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-03 22:36:04,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1215980284, now seen corresponding path program 6 times [2024-06-03 22:36:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685056471] [2024-06-03 22:36:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:11,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-03 22:36:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685056471] [2024-06-03 22:36:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685056471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556318874] [2024-06-03 22:36:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:11,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:11,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:11,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 264 transitions, 3249 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-03 22:36:11,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:11,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:11,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:12,738 INFO L124 PetriNetUnfolderBase]: 2431/3614 cut-off events. [2024-06-03 22:36:12,738 INFO L125 PetriNetUnfolderBase]: For 171321/171325 co-relation queries the response was YES. [2024-06-03 22:36:12,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27954 conditions, 3614 events. 2431/3614 cut-off events. For 171321/171325 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17211 event pairs, 558 based on Foata normal form. 10/3622 useless extension candidates. Maximal degree in co-relation 27859. Up to 3346 conditions per place. [2024-06-03 22:36:12,767 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 242 selfloop transitions, 60 changer transitions 0/305 dead transitions. [2024-06-03 22:36:12,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 305 transitions, 4037 flow [2024-06-03 22:36:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:36:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:36:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-03 22:36:12,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 22:36:12,772 INFO L175 Difference]: Start difference. First operand has 189 places, 264 transitions, 3249 flow. Second operand 9 states and 159 transitions. [2024-06-03 22:36:12,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 305 transitions, 4037 flow [2024-06-03 22:36:12,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 305 transitions, 3915 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 22:36:12,953 INFO L231 Difference]: Finished difference. Result has 194 places, 268 transitions, 3348 flow [2024-06-03 22:36:12,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3127, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3348, PETRI_PLACES=194, PETRI_TRANSITIONS=268} [2024-06-03 22:36:12,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-03 22:36:12,953 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 268 transitions, 3348 flow [2024-06-03 22:36:12,953 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-03 22:36:12,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:12,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:36:12,954 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-03 22:36:12,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 515723604, now seen corresponding path program 7 times [2024-06-03 22:36:12,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:12,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676042026] [2024-06-03 22:36:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676042026] [2024-06-03 22:36:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676042026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922584119] [2024-06-03 22:36:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:20,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:20,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:20,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 268 transitions, 3348 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-03 22:36:20,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:20,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:21,896 INFO L124 PetriNetUnfolderBase]: 2479/3682 cut-off events. [2024-06-03 22:36:21,896 INFO L125 PetriNetUnfolderBase]: For 173731/173735 co-relation queries the response was YES. [2024-06-03 22:36:21,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28522 conditions, 3682 events. 2479/3682 cut-off events. For 173731/173735 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17512 event pairs, 556 based on Foata normal form. 10/3690 useless extension candidates. Maximal degree in co-relation 28426. Up to 3289 conditions per place. [2024-06-03 22:36:21,924 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 242 selfloop transitions, 78 changer transitions 0/323 dead transitions. [2024-06-03 22:36:21,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 323 transitions, 4433 flow [2024-06-03 22:36:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:36:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:36:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-03 22:36:21,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-03 22:36:21,925 INFO L175 Difference]: Start difference. First operand has 194 places, 268 transitions, 3348 flow. Second operand 10 states and 182 transitions. [2024-06-03 22:36:21,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 323 transitions, 4433 flow [2024-06-03 22:36:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 323 transitions, 4281 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 22:36:22,133 INFO L231 Difference]: Finished difference. Result has 199 places, 276 transitions, 3561 flow [2024-06-03 22:36:22,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3561, PETRI_PLACES=199, PETRI_TRANSITIONS=276} [2024-06-03 22:36:22,133 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-03 22:36:22,133 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 276 transitions, 3561 flow [2024-06-03 22:36:22,134 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-03 22:36:22,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:22,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:22,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:36:22,134 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:36:22,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1216153264, now seen corresponding path program 8 times [2024-06-03 22:36:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:22,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976235088] [2024-06-03 22:36:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976235088] [2024-06-03 22:36:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976235088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539165979] [2024-06-03 22:36:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:29,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:29,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:29,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 276 transitions, 3561 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-03 22:36:29,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:29,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:29,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:30,910 INFO L124 PetriNetUnfolderBase]: 2463/3660 cut-off events. [2024-06-03 22:36:30,911 INFO L125 PetriNetUnfolderBase]: For 177473/177477 co-relation queries the response was YES. [2024-06-03 22:36:30,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28448 conditions, 3660 events. 2463/3660 cut-off events. For 177473/177477 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17448 event pairs, 563 based on Foata normal form. 10/3668 useless extension candidates. Maximal degree in co-relation 28350. Up to 3392 conditions per place. [2024-06-03 22:36:30,936 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 252 selfloop transitions, 56 changer transitions 0/311 dead transitions. [2024-06-03 22:36:30,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 311 transitions, 4293 flow [2024-06-03 22:36:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:36:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:36:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-03 22:36:30,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-03 22:36:30,938 INFO L175 Difference]: Start difference. First operand has 199 places, 276 transitions, 3561 flow. Second operand 9 states and 156 transitions. [2024-06-03 22:36:30,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 311 transitions, 4293 flow [2024-06-03 22:36:31,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 311 transitions, 4047 flow, removed 68 selfloop flow, removed 7 redundant places. [2024-06-03 22:36:31,151 INFO L231 Difference]: Finished difference. Result has 201 places, 277 transitions, 3462 flow [2024-06-03 22:36:31,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3462, PETRI_PLACES=201, PETRI_TRANSITIONS=277} [2024-06-03 22:36:31,152 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-03 22:36:31,152 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 277 transitions, 3462 flow [2024-06-03 22:36:31,152 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-03 22:36:31,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:31,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:31,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:36:31,153 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-03 22:36:31,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1222646710, now seen corresponding path program 1 times [2024-06-03 22:36:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:31,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541442514] [2024-06-03 22:36:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541442514] [2024-06-03 22:36:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541442514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:37,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:37,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101217105] [2024-06-03 22:36:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:37,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:37,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:37,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 277 transitions, 3462 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-03 22:36:37,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:37,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:39,207 INFO L124 PetriNetUnfolderBase]: 2458/3653 cut-off events. [2024-06-03 22:36:39,207 INFO L125 PetriNetUnfolderBase]: For 179079/179083 co-relation queries the response was YES. [2024-06-03 22:36:39,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28167 conditions, 3653 events. 2458/3653 cut-off events. For 179079/179083 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17382 event pairs, 566 based on Foata normal form. 6/3657 useless extension candidates. Maximal degree in co-relation 28068. Up to 3553 conditions per place. [2024-06-03 22:36:39,234 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 278 selfloop transitions, 23 changer transitions 0/304 dead transitions. [2024-06-03 22:36:39,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 304 transitions, 4204 flow [2024-06-03 22:36:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:36:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:36:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:36:39,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:36:39,237 INFO L175 Difference]: Start difference. First operand has 201 places, 277 transitions, 3462 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:36:39,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 304 transitions, 4204 flow [2024-06-03 22:36:39,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 304 transitions, 4071 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:36:39,416 INFO L231 Difference]: Finished difference. Result has 201 places, 282 transitions, 3473 flow [2024-06-03 22:36:39,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3333, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3473, PETRI_PLACES=201, PETRI_TRANSITIONS=282} [2024-06-03 22:36:39,417 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-03 22:36:39,417 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 282 transitions, 3473 flow [2024-06-03 22:36:39,417 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-03 22:36:39,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:39,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:36:39,417 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-03 22:36:39,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1452335568, now seen corresponding path program 5 times [2024-06-03 22:36:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131700147] [2024-06-03 22:36:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131700147] [2024-06-03 22:36:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131700147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154943495] [2024-06-03 22:36:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:45,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:45,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:45,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 282 transitions, 3473 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-03 22:36:45,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:45,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:45,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:47,095 INFO L124 PetriNetUnfolderBase]: 2450/3641 cut-off events. [2024-06-03 22:36:47,095 INFO L125 PetriNetUnfolderBase]: For 185756/185760 co-relation queries the response was YES. [2024-06-03 22:36:47,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28216 conditions, 3641 events. 2450/3641 cut-off events. For 185756/185760 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17264 event pairs, 569 based on Foata normal form. 8/3647 useless extension candidates. Maximal degree in co-relation 28116. Up to 3537 conditions per place. [2024-06-03 22:36:47,121 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 282 selfloop transitions, 21 changer transitions 0/306 dead transitions. [2024-06-03 22:36:47,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 306 transitions, 4179 flow [2024-06-03 22:36:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:36:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:36:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:36:47,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:36:47,124 INFO L175 Difference]: Start difference. First operand has 201 places, 282 transitions, 3473 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:36:47,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 306 transitions, 4179 flow [2024-06-03 22:36:47,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 306 transitions, 4106 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 22:36:47,336 INFO L231 Difference]: Finished difference. Result has 204 places, 284 transitions, 3494 flow [2024-06-03 22:36:47,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3400, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3494, PETRI_PLACES=204, PETRI_TRANSITIONS=284} [2024-06-03 22:36:47,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-03 22:36:47,337 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 284 transitions, 3494 flow [2024-06-03 22:36:47,337 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-03 22:36:47,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:47,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:47,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:36:47,338 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-03 22:36:47,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1197765146, now seen corresponding path program 1 times [2024-06-03 22:36:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137242663] [2024-06-03 22:36:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:54,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137242663] [2024-06-03 22:36:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137242663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:54,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:54,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:36:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235380753] [2024-06-03 22:36:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:36:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:36:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:36:54,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:36:54,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 284 transitions, 3494 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:54,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:54,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:36:54,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:56,579 INFO L124 PetriNetUnfolderBase]: 3604/5423 cut-off events. [2024-06-03 22:36:56,579 INFO L125 PetriNetUnfolderBase]: For 374650/374654 co-relation queries the response was YES. [2024-06-03 22:36:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41968 conditions, 5423 events. 3604/5423 cut-off events. For 374650/374654 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 28136 event pairs, 442 based on Foata normal form. 68/5489 useless extension candidates. Maximal degree in co-relation 41867. Up to 2584 conditions per place. [2024-06-03 22:36:56,629 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 246 selfloop transitions, 176 changer transitions 0/425 dead transitions. [2024-06-03 22:36:56,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 425 transitions, 6050 flow [2024-06-03 22:36:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:36:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:36:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 230 transitions. [2024-06-03 22:36:56,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099778270509978 [2024-06-03 22:36:56,630 INFO L175 Difference]: Start difference. First operand has 204 places, 284 transitions, 3494 flow. Second operand 11 states and 230 transitions. [2024-06-03 22:36:56,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 425 transitions, 6050 flow [2024-06-03 22:36:56,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 425 transitions, 5950 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-03 22:36:56,961 INFO L231 Difference]: Finished difference. Result has 216 places, 329 transitions, 4717 flow [2024-06-03 22:36:56,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3420, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4717, PETRI_PLACES=216, PETRI_TRANSITIONS=329} [2024-06-03 22:36:56,961 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2024-06-03 22:36:56,961 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 329 transitions, 4717 flow [2024-06-03 22:36:56,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:56,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:56,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:56,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:36:56,962 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-03 22:36:56,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1453934834, now seen corresponding path program 2 times [2024-06-03 22:36:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468396753] [2024-06-03 22:36:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468396753] [2024-06-03 22:37:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468396753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873437159] [2024-06-03 22:37:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:05,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:05,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 329 transitions, 4717 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:05,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:05,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:07,561 INFO L124 PetriNetUnfolderBase]: 3933/5943 cut-off events. [2024-06-03 22:37:07,561 INFO L125 PetriNetUnfolderBase]: For 383729/383733 co-relation queries the response was YES. [2024-06-03 22:37:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49852 conditions, 5943 events. 3933/5943 cut-off events. For 383729/383733 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31815 event pairs, 943 based on Foata normal form. 28/5969 useless extension candidates. Maximal degree in co-relation 49744. Up to 4854 conditions per place. [2024-06-03 22:37:07,616 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 250 selfloop transitions, 151 changer transitions 0/404 dead transitions. [2024-06-03 22:37:07,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 404 transitions, 6204 flow [2024-06-03 22:37:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:37:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:37:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-03 22:37:07,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2024-06-03 22:37:07,617 INFO L175 Difference]: Start difference. First operand has 216 places, 329 transitions, 4717 flow. Second operand 11 states and 204 transitions. [2024-06-03 22:37:07,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 404 transitions, 6204 flow [2024-06-03 22:37:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 404 transitions, 6052 flow, removed 69 selfloop flow, removed 2 redundant places. [2024-06-03 22:37:08,124 INFO L231 Difference]: Finished difference. Result has 226 places, 342 transitions, 5115 flow [2024-06-03 22:37:08,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5115, PETRI_PLACES=226, PETRI_TRANSITIONS=342} [2024-06-03 22:37:08,124 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-03 22:37:08,124 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 342 transitions, 5115 flow [2024-06-03 22:37:08,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:08,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:08,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:37:08,125 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-03 22:37:08,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1199642816, now seen corresponding path program 3 times [2024-06-03 22:37:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564969416] [2024-06-03 22:37:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564969416] [2024-06-03 22:37:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564969416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776965801] [2024-06-03 22:37:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:16,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:16,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 342 transitions, 5115 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:16,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:16,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:16,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:18,236 INFO L124 PetriNetUnfolderBase]: 3897/5887 cut-off events. [2024-06-03 22:37:18,236 INFO L125 PetriNetUnfolderBase]: For 376549/376553 co-relation queries the response was YES. [2024-06-03 22:37:18,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48888 conditions, 5887 events. 3897/5887 cut-off events. For 376549/376553 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31471 event pairs, 1039 based on Foata normal form. 21/5906 useless extension candidates. Maximal degree in co-relation 48777. Up to 5235 conditions per place. [2024-06-03 22:37:18,290 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 337 selfloop transitions, 86 changer transitions 0/426 dead transitions. [2024-06-03 22:37:18,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 426 transitions, 6679 flow [2024-06-03 22:37:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:37:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:37:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-03 22:37:18,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-03 22:37:18,292 INFO L175 Difference]: Start difference. First operand has 226 places, 342 transitions, 5115 flow. Second operand 10 states and 176 transitions. [2024-06-03 22:37:18,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 426 transitions, 6679 flow [2024-06-03 22:37:18,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 426 transitions, 6514 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-03 22:37:18,844 INFO L231 Difference]: Finished difference. Result has 235 places, 370 transitions, 5747 flow [2024-06-03 22:37:18,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4959, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5747, PETRI_PLACES=235, PETRI_TRANSITIONS=370} [2024-06-03 22:37:18,845 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-03 22:37:18,845 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 370 transitions, 5747 flow [2024-06-03 22:37:18,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:18,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:18,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:18,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:37:18,846 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:37:18,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1457513474, now seen corresponding path program 4 times [2024-06-03 22:37:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414642769] [2024-06-03 22:37:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414642769] [2024-06-03 22:37:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414642769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076910717] [2024-06-03 22:37:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:27,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:27,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 370 transitions, 5747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:27,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:27,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:27,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:29,633 INFO L124 PetriNetUnfolderBase]: 4094/6210 cut-off events. [2024-06-03 22:37:29,633 INFO L125 PetriNetUnfolderBase]: For 430139/430143 co-relation queries the response was YES. [2024-06-03 22:37:29,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51802 conditions, 6210 events. 4094/6210 cut-off events. For 430139/430143 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 33724 event pairs, 1033 based on Foata normal form. 58/6266 useless extension candidates. Maximal degree in co-relation 51685. Up to 5505 conditions per place. [2024-06-03 22:37:29,697 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 314 selfloop transitions, 113 changer transitions 0/430 dead transitions. [2024-06-03 22:37:29,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 430 transitions, 6909 flow [2024-06-03 22:37:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:37:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:37:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-06-03 22:37:29,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-03 22:37:29,698 INFO L175 Difference]: Start difference. First operand has 235 places, 370 transitions, 5747 flow. Second operand 12 states and 208 transitions. [2024-06-03 22:37:29,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 430 transitions, 6909 flow [2024-06-03 22:37:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 430 transitions, 6813 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 22:37:30,362 INFO L231 Difference]: Finished difference. Result has 244 places, 375 transitions, 6038 flow [2024-06-03 22:37:30,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5651, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6038, PETRI_PLACES=244, PETRI_TRANSITIONS=375} [2024-06-03 22:37:30,363 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-03 22:37:30,363 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 375 transitions, 6038 flow [2024-06-03 22:37:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:30,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:30,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:37:30,363 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:37:30,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1457509754, now seen corresponding path program 5 times [2024-06-03 22:37:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890121929] [2024-06-03 22:37:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:39,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890121929] [2024-06-03 22:37:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890121929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350819062] [2024-06-03 22:37:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:39,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:39,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:39,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 375 transitions, 6038 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:39,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:39,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:39,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:41,622 INFO L124 PetriNetUnfolderBase]: 4180/6352 cut-off events. [2024-06-03 22:37:41,622 INFO L125 PetriNetUnfolderBase]: For 422280/422284 co-relation queries the response was YES. [2024-06-03 22:37:41,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53371 conditions, 6352 events. 4180/6352 cut-off events. For 422280/422284 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34765 event pairs, 1019 based on Foata normal form. 28/6378 useless extension candidates. Maximal degree in co-relation 53252. Up to 5499 conditions per place. [2024-06-03 22:37:41,688 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 315 selfloop transitions, 116 changer transitions 0/434 dead transitions. [2024-06-03 22:37:41,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 434 transitions, 7183 flow [2024-06-03 22:37:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:37:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:37:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-06-03 22:37:41,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:37:41,689 INFO L175 Difference]: Start difference. First operand has 244 places, 375 transitions, 6038 flow. Second operand 11 states and 198 transitions. [2024-06-03 22:37:41,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 434 transitions, 7183 flow [2024-06-03 22:37:42,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 434 transitions, 6844 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-03 22:37:42,412 INFO L231 Difference]: Finished difference. Result has 247 places, 379 transitions, 6054 flow [2024-06-03 22:37:42,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5699, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6054, PETRI_PLACES=247, PETRI_TRANSITIONS=379} [2024-06-03 22:37:42,413 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places. [2024-06-03 22:37:42,413 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 379 transitions, 6054 flow [2024-06-03 22:37:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:42,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:42,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:37:42,414 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:37:42,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 742286740, now seen corresponding path program 1 times [2024-06-03 22:37:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604439910] [2024-06-03 22:37:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:50,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:50,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604439910] [2024-06-03 22:37:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604439910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398654771] [2024-06-03 22:37:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:50,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:51,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:37:51,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 379 transitions, 6054 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:51,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:37:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:53,482 INFO L124 PetriNetUnfolderBase]: 4205/6391 cut-off events. [2024-06-03 22:37:53,483 INFO L125 PetriNetUnfolderBase]: For 417178/417182 co-relation queries the response was YES. [2024-06-03 22:37:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53715 conditions, 6391 events. 4205/6391 cut-off events. For 417178/417182 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 34968 event pairs, 1150 based on Foata normal form. 10/6399 useless extension candidates. Maximal degree in co-relation 53594. Up to 6143 conditions per place. [2024-06-03 22:37:53,545 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 357 selfloop transitions, 69 changer transitions 0/429 dead transitions. [2024-06-03 22:37:53,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 429 transitions, 7110 flow [2024-06-03 22:37:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:37:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:37:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-06-03 22:37:53,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40447154471544716 [2024-06-03 22:37:53,546 INFO L175 Difference]: Start difference. First operand has 247 places, 379 transitions, 6054 flow. Second operand 12 states and 199 transitions. [2024-06-03 22:37:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 429 transitions, 7110 flow [2024-06-03 22:37:54,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 429 transitions, 6923 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-03 22:37:54,220 INFO L231 Difference]: Finished difference. Result has 252 places, 382 transitions, 6100 flow [2024-06-03 22:37:54,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6100, PETRI_PLACES=252, PETRI_TRANSITIONS=382} [2024-06-03 22:37:54,221 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-03 22:37:54,221 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 382 transitions, 6100 flow [2024-06-03 22:37:54,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:54,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:54,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:54,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:37:54,221 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-03 22:37:54,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 742078978, now seen corresponding path program 6 times [2024-06-03 22:37:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113433683] [2024-06-03 22:37:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113433683] [2024-06-03 22:38:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113433683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:38:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579979473] [2024-06-03 22:38:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:38:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:38:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:38:02,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:02,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 382 transitions, 6100 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:02,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:02,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:02,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:04,871 INFO L124 PetriNetUnfolderBase]: 4316/6572 cut-off events. [2024-06-03 22:38:04,871 INFO L125 PetriNetUnfolderBase]: For 460275/460279 co-relation queries the response was YES. [2024-06-03 22:38:04,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55261 conditions, 6572 events. 4316/6572 cut-off events. For 460275/460279 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 36298 event pairs, 1126 based on Foata normal form. 34/6604 useless extension candidates. Maximal degree in co-relation 55138. Up to 6155 conditions per place. [2024-06-03 22:38:04,931 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 363 selfloop transitions, 74 changer transitions 0/440 dead transitions. [2024-06-03 22:38:04,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 440 transitions, 7208 flow [2024-06-03 22:38:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:38:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:38:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 218 transitions. [2024-06-03 22:38:04,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090056285178236 [2024-06-03 22:38:04,932 INFO L175 Difference]: Start difference. First operand has 252 places, 382 transitions, 6100 flow. Second operand 13 states and 218 transitions. [2024-06-03 22:38:04,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 440 transitions, 7208 flow [2024-06-03 22:38:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 440 transitions, 7016 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-03 22:38:05,639 INFO L231 Difference]: Finished difference. Result has 257 places, 384 transitions, 6136 flow [2024-06-03 22:38:05,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5908, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6136, PETRI_PLACES=257, PETRI_TRANSITIONS=384} [2024-06-03 22:38:05,640 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-03 22:38:05,640 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 384 transitions, 6136 flow [2024-06-03 22:38:05,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:05,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:05,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:05,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:38:05,640 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-03 22:38:05,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash 565389880, now seen corresponding path program 7 times [2024-06-03 22:38:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709722589] [2024-06-03 22:38:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709722589] [2024-06-03 22:38:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709722589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:38:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289652373] [2024-06-03 22:38:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:38:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:38:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:38:13,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 384 transitions, 6136 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:13,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:13,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:13,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:15,896 INFO L124 PetriNetUnfolderBase]: 4485/6851 cut-off events. [2024-06-03 22:38:15,897 INFO L125 PetriNetUnfolderBase]: For 485799/485803 co-relation queries the response was YES. [2024-06-03 22:38:15,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57960 conditions, 6851 events. 4485/6851 cut-off events. For 485799/485803 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 38302 event pairs, 1223 based on Foata normal form. 17/6866 useless extension candidates. Maximal degree in co-relation 57836. Up to 6180 conditions per place. [2024-06-03 22:38:15,964 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 384 selfloop transitions, 51 changer transitions 0/438 dead transitions. [2024-06-03 22:38:15,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 438 transitions, 7444 flow [2024-06-03 22:38:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:38:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:38:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-03 22:38:15,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-03 22:38:15,967 INFO L175 Difference]: Start difference. First operand has 257 places, 384 transitions, 6136 flow. Second operand 10 states and 175 transitions. [2024-06-03 22:38:15,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 438 transitions, 7444 flow [2024-06-03 22:38:16,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 438 transitions, 7262 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-06-03 22:38:16,866 INFO L231 Difference]: Finished difference. Result has 257 places, 387 transitions, 6143 flow [2024-06-03 22:38:16,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5956, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6143, PETRI_PLACES=257, PETRI_TRANSITIONS=387} [2024-06-03 22:38:16,867 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-03 22:38:16,867 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 387 transitions, 6143 flow [2024-06-03 22:38:16,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:16,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:16,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:16,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:38:16,868 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-03 22:38:16,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash 725928998, now seen corresponding path program 2 times [2024-06-03 22:38:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903299086] [2024-06-03 22:38:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903299086] [2024-06-03 22:38:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903299086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:38:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884939355] [2024-06-03 22:38:24,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:24,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:38:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:38:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:38:24,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:24,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 387 transitions, 6143 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:24,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:24,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:24,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:27,445 INFO L124 PetriNetUnfolderBase]: 4527/6917 cut-off events. [2024-06-03 22:38:27,446 INFO L125 PetriNetUnfolderBase]: For 494078/494082 co-relation queries the response was YES. [2024-06-03 22:38:27,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58734 conditions, 6917 events. 4527/6917 cut-off events. For 494078/494082 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38846 event pairs, 1253 based on Foata normal form. 5/6920 useless extension candidates. Maximal degree in co-relation 58608. Up to 6665 conditions per place. [2024-06-03 22:38:27,523 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 395 selfloop transitions, 41 changer transitions 0/439 dead transitions. [2024-06-03 22:38:27,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 439 transitions, 7444 flow [2024-06-03 22:38:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:38:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:38:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-06-03 22:38:27,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968957871396896 [2024-06-03 22:38:27,525 INFO L175 Difference]: Start difference. First operand has 257 places, 387 transitions, 6143 flow. Second operand 11 states and 179 transitions. [2024-06-03 22:38:27,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 439 transitions, 7444 flow [2024-06-03 22:38:28,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 439 transitions, 7366 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:38:28,420 INFO L231 Difference]: Finished difference. Result has 264 places, 393 transitions, 6286 flow [2024-06-03 22:38:28,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6065, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6286, PETRI_PLACES=264, PETRI_TRANSITIONS=393} [2024-06-03 22:38:28,420 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:38:28,420 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 393 transitions, 6286 flow [2024-06-03 22:38:28,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:28,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:28,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:38:28,421 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-03 22:38:28,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 720207266, now seen corresponding path program 8 times [2024-06-03 22:38:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999821870] [2024-06-03 22:38:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:38:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999821870] [2024-06-03 22:38:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999821870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:38:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806367655] [2024-06-03 22:38:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:35,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:38:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:38:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:38:36,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:36,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 393 transitions, 6286 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:36,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:36,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:38,752 INFO L124 PetriNetUnfolderBase]: 4602/7042 cut-off events. [2024-06-03 22:38:38,752 INFO L125 PetriNetUnfolderBase]: For 531208/531212 co-relation queries the response was YES. [2024-06-03 22:38:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59934 conditions, 7042 events. 4602/7042 cut-off events. For 531208/531212 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 39841 event pairs, 1278 based on Foata normal form. 21/7061 useless extension candidates. Maximal degree in co-relation 59804. Up to 6662 conditions per place. [2024-06-03 22:38:38,815 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 387 selfloop transitions, 49 changer transitions 0/439 dead transitions. [2024-06-03 22:38:38,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 439 transitions, 7332 flow [2024-06-03 22:38:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:38:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:38:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-03 22:38:38,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170731707317073 [2024-06-03 22:38:38,818 INFO L175 Difference]: Start difference. First operand has 264 places, 393 transitions, 6286 flow. Second operand 10 states and 171 transitions. [2024-06-03 22:38:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 439 transitions, 7332 flow [2024-06-03 22:38:39,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 439 transitions, 7224 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-03 22:38:39,677 INFO L231 Difference]: Finished difference. Result has 267 places, 394 transitions, 6313 flow [2024-06-03 22:38:39,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6178, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6313, PETRI_PLACES=267, PETRI_TRANSITIONS=394} [2024-06-03 22:38:39,677 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places. [2024-06-03 22:38:39,677 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 394 transitions, 6313 flow [2024-06-03 22:38:39,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:39,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:39,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:38:39,678 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:38:39,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 565537750, now seen corresponding path program 9 times [2024-06-03 22:38:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771648312] [2024-06-03 22:38:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:47,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-03 22:38:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771648312] [2024-06-03 22:38:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771648312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:38:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916158080] [2024-06-03 22:38:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:47,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:38:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:38:47,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:38:47,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:47,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 394 transitions, 6313 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:47,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:47,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:38:50,175 INFO L124 PetriNetUnfolderBase]: 4602/7042 cut-off events. [2024-06-03 22:38:50,175 INFO L125 PetriNetUnfolderBase]: For 540989/540993 co-relation queries the response was YES. [2024-06-03 22:38:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59580 conditions, 7042 events. 4602/7042 cut-off events. For 540989/540993 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39769 event pairs, 1237 based on Foata normal form. 34/7074 useless extension candidates. Maximal degree in co-relation 59448. Up to 6625 conditions per place. [2024-06-03 22:38:50,244 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 368 selfloop transitions, 73 changer transitions 0/444 dead transitions. [2024-06-03 22:38:50,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 444 transitions, 7414 flow [2024-06-03 22:38:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:38:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:38:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-03 22:38:50,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-03 22:38:50,245 INFO L175 Difference]: Start difference. First operand has 267 places, 394 transitions, 6313 flow. Second operand 11 states and 190 transitions. [2024-06-03 22:38:50,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 444 transitions, 7414 flow [2024-06-03 22:38:51,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 444 transitions, 7287 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 22:38:51,203 INFO L231 Difference]: Finished difference. Result has 270 places, 396 transitions, 6417 flow [2024-06-03 22:38:51,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6196, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6417, PETRI_PLACES=270, PETRI_TRANSITIONS=396} [2024-06-03 22:38:51,204 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-03 22:38:51,204 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 396 transitions, 6417 flow [2024-06-03 22:38:51,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:51,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:38:51,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:38:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:38:51,204 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-03 22:38:51,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:38:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash 565543702, now seen corresponding path program 3 times [2024-06-03 22:38:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:38:51,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246944335] [2024-06-03 22:38:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:38:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:38:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:38:57,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-03 22:38:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:38:57,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246944335] [2024-06-03 22:38:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246944335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:38:57,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:38:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:38:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045632018] [2024-06-03 22:38:57,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:38:57,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:38:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:38:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:38:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:38:58,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:38:58,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 396 transitions, 6417 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:38:58,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:38:58,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:38:58,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:00,469 INFO L124 PetriNetUnfolderBase]: 4594/7030 cut-off events. [2024-06-03 22:39:00,470 INFO L125 PetriNetUnfolderBase]: For 520194/520198 co-relation queries the response was YES. [2024-06-03 22:39:00,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59549 conditions, 7030 events. 4594/7030 cut-off events. For 520194/520198 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39767 event pairs, 1236 based on Foata normal form. 5/7033 useless extension candidates. Maximal degree in co-relation 59416. Up to 6843 conditions per place. [2024-06-03 22:39:00,539 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 395 selfloop transitions, 34 changer transitions 0/432 dead transitions. [2024-06-03 22:39:00,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 432 transitions, 7377 flow [2024-06-03 22:39:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:39:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:39:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-03 22:39:00,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-03 22:39:00,541 INFO L175 Difference]: Start difference. First operand has 270 places, 396 transitions, 6417 flow. Second operand 9 states and 151 transitions. [2024-06-03 22:39:00,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 432 transitions, 7377 flow [2024-06-03 22:39:01,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 432 transitions, 7185 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-03 22:39:01,359 INFO L231 Difference]: Finished difference. Result has 270 places, 396 transitions, 6300 flow [2024-06-03 22:39:01,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6300, PETRI_PLACES=270, PETRI_TRANSITIONS=396} [2024-06-03 22:39:01,360 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-03 22:39:01,360 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 396 transitions, 6300 flow [2024-06-03 22:39:01,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:01,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:01,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:01,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:39:01,360 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:39:01,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -520278762, now seen corresponding path program 1 times [2024-06-03 22:39:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326415952] [2024-06-03 22:39:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:09,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-03 22:39:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326415952] [2024-06-03 22:39:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326415952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:39:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806691173] [2024-06-03 22:39:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:39:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:39:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:39:10,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:39:10,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 396 transitions, 6300 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:10,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:10,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:39:10,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:12,278 INFO L124 PetriNetUnfolderBase]: 4469/6875 cut-off events. [2024-06-03 22:39:12,278 INFO L125 PetriNetUnfolderBase]: For 530454/530497 co-relation queries the response was YES. [2024-06-03 22:39:12,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58481 conditions, 6875 events. 4469/6875 cut-off events. For 530454/530497 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 39103 event pairs, 1225 based on Foata normal form. 16/6852 useless extension candidates. Maximal degree in co-relation 58347. Up to 6653 conditions per place. [2024-06-03 22:39:12,349 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 348 selfloop transitions, 51 changer transitions 0/419 dead transitions. [2024-06-03 22:39:12,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 419 transitions, 7288 flow [2024-06-03 22:39:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:39:12,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:39:12,350 INFO L175 Difference]: Start difference. First operand has 270 places, 396 transitions, 6300 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:39:12,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 419 transitions, 7288 flow [2024-06-03 22:39:13,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 419 transitions, 7229 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:39:13,241 INFO L231 Difference]: Finished difference. Result has 273 places, 398 transitions, 6388 flow [2024-06-03 22:39:13,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6241, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6388, PETRI_PLACES=273, PETRI_TRANSITIONS=398} [2024-06-03 22:39:13,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-03 22:39:13,242 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 398 transitions, 6388 flow [2024-06-03 22:39:13,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:13,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:13,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:13,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:39:13,242 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-03 22:39:13,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1405389560, now seen corresponding path program 4 times [2024-06-03 22:39:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137087007] [2024-06-03 22:39:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137087007] [2024-06-03 22:39:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137087007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:39:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551562449] [2024-06-03 22:39:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:39:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:39:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:39:20,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:20,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 398 transitions, 6388 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:20,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:20,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:22,530 INFO L124 PetriNetUnfolderBase]: 4593/7033 cut-off events. [2024-06-03 22:39:22,530 INFO L125 PetriNetUnfolderBase]: For 540396/540400 co-relation queries the response was YES. [2024-06-03 22:39:22,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59507 conditions, 7033 events. 4593/7033 cut-off events. For 540396/540400 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39847 event pairs, 1311 based on Foata normal form. 5/7036 useless extension candidates. Maximal degree in co-relation 59372. Up to 6835 conditions per place. [2024-06-03 22:39:22,603 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 399 selfloop transitions, 34 changer transitions 0/436 dead transitions. [2024-06-03 22:39:22,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 436 transitions, 7434 flow [2024-06-03 22:39:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:39:22,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:39:22,605 INFO L175 Difference]: Start difference. First operand has 273 places, 398 transitions, 6388 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:39:22,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 436 transitions, 7434 flow [2024-06-03 22:39:23,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 436 transitions, 7269 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:23,510 INFO L231 Difference]: Finished difference. Result has 276 places, 402 transitions, 6405 flow [2024-06-03 22:39:23,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6405, PETRI_PLACES=276, PETRI_TRANSITIONS=402} [2024-06-03 22:39:23,511 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2024-06-03 22:39:23,511 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 402 transitions, 6405 flow [2024-06-03 22:39:23,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:23,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:23,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:23,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:39:23,511 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-03 22:39:23,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -959316104, now seen corresponding path program 10 times [2024-06-03 22:39:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36487269] [2024-06-03 22:39:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36487269] [2024-06-03 22:39:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36487269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:30,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:30,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:39:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310931139] [2024-06-03 22:39:30,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:30,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:39:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:30,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:39:30,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:39:30,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:30,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 402 transitions, 6405 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:30,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:30,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:30,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:33,590 INFO L124 PetriNetUnfolderBase]: 4704/7214 cut-off events. [2024-06-03 22:39:33,591 INFO L125 PetriNetUnfolderBase]: For 603257/603261 co-relation queries the response was YES. [2024-06-03 22:39:33,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61124 conditions, 7214 events. 4704/7214 cut-off events. For 603257/603261 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 41220 event pairs, 1317 based on Foata normal form. 34/7246 useless extension candidates. Maximal degree in co-relation 60989. Up to 6784 conditions per place. [2024-06-03 22:39:33,669 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 373 selfloop transitions, 74 changer transitions 0/450 dead transitions. [2024-06-03 22:39:33,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 450 transitions, 7515 flow [2024-06-03 22:39:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:39:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:39:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-03 22:39:33,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317073170731707 [2024-06-03 22:39:33,677 INFO L175 Difference]: Start difference. First operand has 276 places, 402 transitions, 6405 flow. Second operand 10 states and 177 transitions. [2024-06-03 22:39:33,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 450 transitions, 7515 flow [2024-06-03 22:39:34,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 450 transitions, 7423 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 22:39:34,796 INFO L231 Difference]: Finished difference. Result has 282 places, 404 transitions, 6549 flow [2024-06-03 22:39:34,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6313, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6549, PETRI_PLACES=282, PETRI_TRANSITIONS=404} [2024-06-03 22:39:34,797 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places. [2024-06-03 22:39:34,797 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 404 transitions, 6549 flow [2024-06-03 22:39:34,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:34,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:34,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:34,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:39:34,797 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-03 22:39:34,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1192440424, now seen corresponding path program 11 times [2024-06-03 22:39:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784679349] [2024-06-03 22:39:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784679349] [2024-06-03 22:39:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784679349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:39:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528688834] [2024-06-03 22:39:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:39:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:39:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:39:42,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:42,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 404 transitions, 6549 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:42,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:42,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:42,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:45,742 INFO L124 PetriNetUnfolderBase]: 4935/7587 cut-off events. [2024-06-03 22:39:45,742 INFO L125 PetriNetUnfolderBase]: For 665435/665439 co-relation queries the response was YES. [2024-06-03 22:39:45,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65772 conditions, 7587 events. 4935/7587 cut-off events. For 665435/665439 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 43917 event pairs, 1226 based on Foata normal form. 28/7613 useless extension candidates. Maximal degree in co-relation 65636. Up to 6584 conditions per place. [2024-06-03 22:39:45,814 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 353 selfloop transitions, 107 changer transitions 0/463 dead transitions. [2024-06-03 22:39:45,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 463 transitions, 8021 flow [2024-06-03 22:39:45,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:39:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:39:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-03 22:39:45,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-03 22:39:45,816 INFO L175 Difference]: Start difference. First operand has 282 places, 404 transitions, 6549 flow. Second operand 10 states and 187 transitions. [2024-06-03 22:39:45,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 463 transitions, 8021 flow [2024-06-03 22:39:46,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 463 transitions, 7833 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 22:39:46,855 INFO L231 Difference]: Finished difference. Result has 285 places, 409 transitions, 6778 flow [2024-06-03 22:39:46,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6361, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6778, PETRI_PLACES=285, PETRI_TRANSITIONS=409} [2024-06-03 22:39:46,855 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-03 22:39:46,855 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 409 transitions, 6778 flow [2024-06-03 22:39:46,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:46,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:46,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:46,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:39:46,856 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-03 22:39:46,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 646263190, now seen corresponding path program 5 times [2024-06-03 22:39:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167264246] [2024-06-03 22:39:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:39:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:39:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:39:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167264246] [2024-06-03 22:39:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167264246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:39:53,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:39:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:39:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699275163] [2024-06-03 22:39:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:39:53,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:39:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:39:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:39:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:39:53,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:39:53,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 409 transitions, 6778 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:39:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:39:53,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:39:56,596 INFO L124 PetriNetUnfolderBase]: 4952/7614 cut-off events. [2024-06-03 22:39:56,596 INFO L125 PetriNetUnfolderBase]: For 657179/657183 co-relation queries the response was YES. [2024-06-03 22:39:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66389 conditions, 7614 events. 4952/7614 cut-off events. For 657179/657183 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 44213 event pairs, 1408 based on Foata normal form. 5/7617 useless extension candidates. Maximal degree in co-relation 66251. Up to 7416 conditions per place. [2024-06-03 22:39:56,671 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 407 selfloop transitions, 32 changer transitions 0/442 dead transitions. [2024-06-03 22:39:56,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 442 transitions, 7798 flow [2024-06-03 22:39:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:39:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:39:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:39:56,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:39:56,674 INFO L175 Difference]: Start difference. First operand has 285 places, 409 transitions, 6778 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:39:56,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 442 transitions, 7798 flow [2024-06-03 22:39:57,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 442 transitions, 7610 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 22:39:57,710 INFO L231 Difference]: Finished difference. Result has 287 places, 411 transitions, 6719 flow [2024-06-03 22:39:57,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6590, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6719, PETRI_PLACES=287, PETRI_TRANSITIONS=411} [2024-06-03 22:39:57,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-03 22:39:57,711 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 411 transitions, 6719 flow [2024-06-03 22:39:57,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:39:57,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:39:57,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:39:57,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:39:57,712 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-03 22:39:57,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:39:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1816020582, now seen corresponding path program 6 times [2024-06-03 22:39:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:39:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265450491] [2024-06-03 22:39:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:39:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:39:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265450491] [2024-06-03 22:40:04,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265450491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:04,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:04,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838647037] [2024-06-03 22:40:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:04,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:04,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:04,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 411 transitions, 6719 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:04,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:04,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:04,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:07,001 INFO L124 PetriNetUnfolderBase]: 4969/7641 cut-off events. [2024-06-03 22:40:07,001 INFO L125 PetriNetUnfolderBase]: For 669679/669683 co-relation queries the response was YES. [2024-06-03 22:40:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66549 conditions, 7641 events. 4969/7641 cut-off events. For 669679/669683 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 44404 event pairs, 1431 based on Foata normal form. 8/7647 useless extension candidates. Maximal degree in co-relation 66409. Up to 7550 conditions per place. [2024-06-03 22:40:07,079 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 420 selfloop transitions, 17 changer transitions 0/440 dead transitions. [2024-06-03 22:40:07,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 440 transitions, 7727 flow [2024-06-03 22:40:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-03 22:40:07,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-03 22:40:07,082 INFO L175 Difference]: Start difference. First operand has 287 places, 411 transitions, 6719 flow. Second operand 8 states and 127 transitions. [2024-06-03 22:40:07,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 440 transitions, 7727 flow [2024-06-03 22:40:08,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 440 transitions, 7644 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 22:40:08,152 INFO L231 Difference]: Finished difference. Result has 292 places, 413 transitions, 6739 flow [2024-06-03 22:40:08,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6636, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6739, PETRI_PLACES=292, PETRI_TRANSITIONS=413} [2024-06-03 22:40:08,152 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 250 predicate places. [2024-06-03 22:40:08,152 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 413 transitions, 6739 flow [2024-06-03 22:40:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:08,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:08,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:40:08,153 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:40:08,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2072730342, now seen corresponding path program 7 times [2024-06-03 22:40:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944595498] [2024-06-03 22:40:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944595498] [2024-06-03 22:40:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944595498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350914592] [2024-06-03 22:40:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:15,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:15,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 413 transitions, 6739 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:15,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:15,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:15,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:17,702 INFO L124 PetriNetUnfolderBase]: 5011/7707 cut-off events. [2024-06-03 22:40:17,703 INFO L125 PetriNetUnfolderBase]: For 700178/700182 co-relation queries the response was YES. [2024-06-03 22:40:17,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67678 conditions, 7707 events. 5011/7707 cut-off events. For 700178/700182 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 44881 event pairs, 1438 based on Foata normal form. 8/7713 useless extension candidates. Maximal degree in co-relation 67537. Up to 7496 conditions per place. [2024-06-03 22:40:17,783 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 412 selfloop transitions, 31 changer transitions 0/446 dead transitions. [2024-06-03 22:40:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 446 transitions, 8059 flow [2024-06-03 22:40:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:40:17,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:40:17,786 INFO L175 Difference]: Start difference. First operand has 292 places, 413 transitions, 6739 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:40:17,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 446 transitions, 8059 flow [2024-06-03 22:40:18,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 446 transitions, 7982 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-03 22:40:18,819 INFO L231 Difference]: Finished difference. Result has 296 places, 417 transitions, 6860 flow [2024-06-03 22:40:18,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6662, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6860, PETRI_PLACES=296, PETRI_TRANSITIONS=417} [2024-06-03 22:40:18,819 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-03 22:40:18,819 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 417 transitions, 6860 flow [2024-06-03 22:40:18,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:18,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:18,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:18,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:40:18,820 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:40:18,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1816014630, now seen corresponding path program 12 times [2024-06-03 22:40:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754824425] [2024-06-03 22:40:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:26,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754824425] [2024-06-03 22:40:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754824425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560905464] [2024-06-03 22:40:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:26,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:26,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:26,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 417 transitions, 6860 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:26,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:26,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:26,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:29,733 INFO L124 PetriNetUnfolderBase]: 5122/7888 cut-off events. [2024-06-03 22:40:29,733 INFO L125 PetriNetUnfolderBase]: For 772957/772961 co-relation queries the response was YES. [2024-06-03 22:40:29,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69381 conditions, 7888 events. 5122/7888 cut-off events. For 772957/772961 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46214 event pairs, 1452 based on Foata normal form. 34/7920 useless extension candidates. Maximal degree in co-relation 69239. Up to 7597 conditions per place. [2024-06-03 22:40:29,808 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 415 selfloop transitions, 36 changer transitions 0/454 dead transitions. [2024-06-03 22:40:29,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 454 transitions, 7948 flow [2024-06-03 22:40:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:40:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:40:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-03 22:40:29,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-03 22:40:29,810 INFO L175 Difference]: Start difference. First operand has 296 places, 417 transitions, 6860 flow. Second operand 9 states and 151 transitions. [2024-06-03 22:40:29,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 454 transitions, 7948 flow [2024-06-03 22:40:31,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 454 transitions, 7843 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-03 22:40:31,076 INFO L231 Difference]: Finished difference. Result has 301 places, 419 transitions, 6915 flow [2024-06-03 22:40:31,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6755, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6915, PETRI_PLACES=301, PETRI_TRANSITIONS=419} [2024-06-03 22:40:31,079 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-03 22:40:31,079 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 419 transitions, 6915 flow [2024-06-03 22:40:31,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:31,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:31,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:31,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:40:31,080 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:40:31,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2081927112, now seen corresponding path program 8 times [2024-06-03 22:40:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781924991] [2024-06-03 22:40:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781924991] [2024-06-03 22:40:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781924991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:38,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138118695] [2024-06-03 22:40:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:38,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:38,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:38,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:38,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 419 transitions, 6915 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:38,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:38,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:38,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:41,728 INFO L124 PetriNetUnfolderBase]: 5147/7927 cut-off events. [2024-06-03 22:40:41,728 INFO L125 PetriNetUnfolderBase]: For 753198/753202 co-relation queries the response was YES. [2024-06-03 22:40:41,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70117 conditions, 7927 events. 5147/7927 cut-off events. For 753198/753202 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 46412 event pairs, 1466 based on Foata normal form. 10/7935 useless extension candidates. Maximal degree in co-relation 69973. Up to 7786 conditions per place. [2024-06-03 22:40:41,820 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 29 changer transitions 0/448 dead transitions. [2024-06-03 22:40:41,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 448 transitions, 7975 flow [2024-06-03 22:40:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:40:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:40:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:40:41,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:40:41,821 INFO L175 Difference]: Start difference. First operand has 301 places, 419 transitions, 6915 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:40:41,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 448 transitions, 7975 flow [2024-06-03 22:40:43,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 448 transitions, 7869 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 22:40:43,153 INFO L231 Difference]: Finished difference. Result has 302 places, 422 transitions, 6987 flow [2024-06-03 22:40:43,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6809, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6987, PETRI_PLACES=302, PETRI_TRANSITIONS=422} [2024-06-03 22:40:43,153 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 260 predicate places. [2024-06-03 22:40:43,153 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 422 transitions, 6987 flow [2024-06-03 22:40:43,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:43,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:43,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:43,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:40:43,154 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-03 22:40:43,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash -959460254, now seen corresponding path program 13 times [2024-06-03 22:40:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292836140] [2024-06-03 22:40:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:40:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:40:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:40:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292836140] [2024-06-03 22:40:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292836140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:40:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:40:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:40:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428189756] [2024-06-03 22:40:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:40:50,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:40:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:40:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:40:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:40:51,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:40:51,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 422 transitions, 6987 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:51,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:40:51,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:40:51,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:40:53,948 INFO L124 PetriNetUnfolderBase]: 5222/8052 cut-off events. [2024-06-03 22:40:53,948 INFO L125 PetriNetUnfolderBase]: For 799485/799489 co-relation queries the response was YES. [2024-06-03 22:40:54,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70971 conditions, 8052 events. 5222/8052 cut-off events. For 799485/799489 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47540 event pairs, 1453 based on Foata normal form. 21/8071 useless extension candidates. Maximal degree in co-relation 70826. Up to 7603 conditions per place. [2024-06-03 22:40:54,035 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 411 selfloop transitions, 60 changer transitions 0/474 dead transitions. [2024-06-03 22:40:54,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 474 transitions, 8395 flow [2024-06-03 22:40:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:40:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:40:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-03 22:40:54,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 22:40:54,037 INFO L175 Difference]: Start difference. First operand has 302 places, 422 transitions, 6987 flow. Second operand 9 states and 165 transitions. [2024-06-03 22:40:54,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 474 transitions, 8395 flow [2024-06-03 22:40:55,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 474 transitions, 8241 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-06-03 22:40:55,249 INFO L231 Difference]: Finished difference. Result has 306 places, 426 transitions, 7061 flow [2024-06-03 22:40:55,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6833, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7061, PETRI_PLACES=306, PETRI_TRANSITIONS=426} [2024-06-03 22:40:55,249 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places. [2024-06-03 22:40:55,249 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 426 transitions, 7061 flow [2024-06-03 22:40:55,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:40:55,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:40:55,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:40:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:40:55,250 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-03 22:40:55,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:40:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 646270630, now seen corresponding path program 9 times [2024-06-03 22:40:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:40:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104623040] [2024-06-03 22:40:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:40:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:40:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104623040] [2024-06-03 22:41:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104623040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:41:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713700485] [2024-06-03 22:41:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:02,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:41:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:02,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:41:02,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:41:02,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:02,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 426 transitions, 7061 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:02,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:02,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:02,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:05,783 INFO L124 PetriNetUnfolderBase]: 5214/8040 cut-off events. [2024-06-03 22:41:05,783 INFO L125 PetriNetUnfolderBase]: For 785794/785798 co-relation queries the response was YES. [2024-06-03 22:41:05,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71056 conditions, 8040 events. 5214/8040 cut-off events. For 785794/785798 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47574 event pairs, 1485 based on Foata normal form. 5/8043 useless extension candidates. Maximal degree in co-relation 70909. Up to 7783 conditions per place. [2024-06-03 22:41:05,858 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 420 selfloop transitions, 37 changer transitions 0/460 dead transitions. [2024-06-03 22:41:05,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 460 transitions, 8137 flow [2024-06-03 22:41:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:41:05,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:41:05,860 INFO L175 Difference]: Start difference. First operand has 306 places, 426 transitions, 7061 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:41:05,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 460 transitions, 8137 flow [2024-06-03 22:41:07,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 460 transitions, 8025 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 22:41:07,024 INFO L231 Difference]: Finished difference. Result has 310 places, 429 transitions, 7121 flow [2024-06-03 22:41:07,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6949, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7121, PETRI_PLACES=310, PETRI_TRANSITIONS=429} [2024-06-03 22:41:07,024 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 268 predicate places. [2024-06-03 22:41:07,024 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 429 transitions, 7121 flow [2024-06-03 22:41:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:07,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:07,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:41:07,025 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-03 22:41:07,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2072722685, now seen corresponding path program 1 times [2024-06-03 22:41:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409737588] [2024-06-03 22:41:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:13,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:13,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409737588] [2024-06-03 22:41:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409737588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685176732] [2024-06-03 22:41:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:13,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:13,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:13,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 429 transitions, 7121 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:13,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:13,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:13,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:16,490 INFO L124 PetriNetUnfolderBase]: 5209/8033 cut-off events. [2024-06-03 22:41:16,491 INFO L125 PetriNetUnfolderBase]: For 798560/798564 co-relation queries the response was YES. [2024-06-03 22:41:16,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71154 conditions, 8033 events. 5209/8033 cut-off events. For 798560/798564 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47507 event pairs, 1482 based on Foata normal form. 6/8037 useless extension candidates. Maximal degree in co-relation 71005. Up to 7901 conditions per place. [2024-06-03 22:41:16,574 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 424 selfloop transitions, 29 changer transitions 0/456 dead transitions. [2024-06-03 22:41:16,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 456 transitions, 8105 flow [2024-06-03 22:41:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-03 22:41:16,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-03 22:41:16,576 INFO L175 Difference]: Start difference. First operand has 310 places, 429 transitions, 7121 flow. Second operand 8 states and 129 transitions. [2024-06-03 22:41:16,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 456 transitions, 8105 flow [2024-06-03 22:41:17,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 456 transitions, 7951 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-03 22:41:17,949 INFO L231 Difference]: Finished difference. Result has 313 places, 429 transitions, 7037 flow [2024-06-03 22:41:17,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6967, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7037, PETRI_PLACES=313, PETRI_TRANSITIONS=429} [2024-06-03 22:41:17,949 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 271 predicate places. [2024-06-03 22:41:17,949 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 429 transitions, 7037 flow [2024-06-03 22:41:17,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:17,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:17,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:17,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:41:17,950 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-03 22:41:17,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -953953724, now seen corresponding path program 14 times [2024-06-03 22:41:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011174304] [2024-06-03 22:41:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011174304] [2024-06-03 22:41:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011174304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:25,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602168754] [2024-06-03 22:41:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:25,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:25,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:25,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 429 transitions, 7037 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:25,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:25,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:28,476 INFO L124 PetriNetUnfolderBase]: 5209/8033 cut-off events. [2024-06-03 22:41:28,476 INFO L125 PetriNetUnfolderBase]: For 842516/842520 co-relation queries the response was YES. [2024-06-03 22:41:28,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70242 conditions, 8033 events. 5209/8033 cut-off events. For 842516/842520 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47492 event pairs, 1445 based on Foata normal form. 34/8065 useless extension candidates. Maximal degree in co-relation 70092. Up to 7603 conditions per place. [2024-06-03 22:41:28,575 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 401 selfloop transitions, 70 changer transitions 0/474 dead transitions. [2024-06-03 22:41:28,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 474 transitions, 8193 flow [2024-06-03 22:41:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:41:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:41:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-03 22:41:28,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-03 22:41:28,576 INFO L175 Difference]: Start difference. First operand has 313 places, 429 transitions, 7037 flow. Second operand 10 states and 174 transitions. [2024-06-03 22:41:28,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 474 transitions, 8193 flow [2024-06-03 22:41:30,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 474 transitions, 8139 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:41:30,151 INFO L231 Difference]: Finished difference. Result has 317 places, 431 transitions, 7217 flow [2024-06-03 22:41:30,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6983, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7217, PETRI_PLACES=317, PETRI_TRANSITIONS=431} [2024-06-03 22:41:30,152 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-03 22:41:30,152 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 431 transitions, 7217 flow [2024-06-03 22:41:30,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:30,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:30,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:30,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:41:30,152 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-03 22:41:30,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1823372232, now seen corresponding path program 10 times [2024-06-03 22:41:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142831528] [2024-06-03 22:41:30,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142831528] [2024-06-03 22:41:36,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142831528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:36,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:41:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117911397] [2024-06-03 22:41:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:36,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:41:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:41:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:41:37,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:41:37,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 431 transitions, 7217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:37,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:37,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:41:37,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:39,985 INFO L124 PetriNetUnfolderBase]: 5201/8021 cut-off events. [2024-06-03 22:41:39,985 INFO L125 PetriNetUnfolderBase]: For 802198/802202 co-relation queries the response was YES. [2024-06-03 22:41:40,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70493 conditions, 8021 events. 5201/8021 cut-off events. For 802198/802202 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47337 event pairs, 1475 based on Foata normal form. 8/8027 useless extension candidates. Maximal degree in co-relation 70342. Up to 7885 conditions per place. [2024-06-03 22:41:40,061 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 428 selfloop transitions, 27 changer transitions 0/458 dead transitions. [2024-06-03 22:41:40,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 458 transitions, 8203 flow [2024-06-03 22:41:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:41:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:41:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:41:40,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:41:40,064 INFO L175 Difference]: Start difference. First operand has 317 places, 431 transitions, 7217 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:41:40,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 458 transitions, 8203 flow [2024-06-03 22:41:41,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 458 transitions, 7993 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-03 22:41:41,543 INFO L231 Difference]: Finished difference. Result has 317 places, 431 transitions, 7071 flow [2024-06-03 22:41:41,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7007, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7071, PETRI_PLACES=317, PETRI_TRANSITIONS=431} [2024-06-03 22:41:41,544 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-03 22:41:41,544 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 431 transitions, 7071 flow [2024-06-03 22:41:41,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:41,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:41,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:41,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:41:41,544 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:41:41,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -364753992, now seen corresponding path program 2 times [2024-06-03 22:41:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310908199] [2024-06-03 22:41:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:41:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:41:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:41:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310908199] [2024-06-03 22:41:50,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310908199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:41:50,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:41:50,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:41:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485217843] [2024-06-03 22:41:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:41:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:41:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:41:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:41:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:41:50,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:41:50,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 431 transitions, 7071 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:50,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:41:50,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:41:50,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:41:52,759 INFO L124 PetriNetUnfolderBase]: 5122/7930 cut-off events. [2024-06-03 22:41:52,759 INFO L125 PetriNetUnfolderBase]: For 823873/823915 co-relation queries the response was YES. [2024-06-03 22:41:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69924 conditions, 7930 events. 5122/7930 cut-off events. For 823873/823915 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 47093 event pairs, 1313 based on Foata normal form. 10/7898 useless extension candidates. Maximal degree in co-relation 69772. Up to 7694 conditions per place. [2024-06-03 22:41:52,843 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 378 selfloop transitions, 60 changer transitions 0/459 dead transitions. [2024-06-03 22:41:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 459 transitions, 8246 flow [2024-06-03 22:41:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:41:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:41:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:41:52,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:41:52,845 INFO L175 Difference]: Start difference. First operand has 317 places, 431 transitions, 7071 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:41:52,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 459 transitions, 8246 flow [2024-06-03 22:41:54,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 459 transitions, 8184 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:41:54,680 INFO L231 Difference]: Finished difference. Result has 317 places, 439 transitions, 7268 flow [2024-06-03 22:41:54,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7009, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7268, PETRI_PLACES=317, PETRI_TRANSITIONS=439} [2024-06-03 22:41:54,681 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-03 22:41:54,681 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 439 transitions, 7268 flow [2024-06-03 22:41:54,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:41:54,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:41:54,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:41:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:41:54,681 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-03 22:41:54,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:41:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1282191948, now seen corresponding path program 3 times [2024-06-03 22:41:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:41:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110194104] [2024-06-03 22:41:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:41:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:41:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110194104] [2024-06-03 22:42:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110194104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:42:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727075259] [2024-06-03 22:42:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:03,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:42:03,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:42:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:42:03,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:42:03,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 439 transitions, 7268 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:03,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:03,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:42:03,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:06,123 INFO L124 PetriNetUnfolderBase]: 5127/7937 cut-off events. [2024-06-03 22:42:06,123 INFO L125 PetriNetUnfolderBase]: For 840904/840938 co-relation queries the response was YES. [2024-06-03 22:42:06,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70289 conditions, 7937 events. 5127/7937 cut-off events. For 840904/840938 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47078 event pairs, 1418 based on Foata normal form. 10/7903 useless extension candidates. Maximal degree in co-relation 70136. Up to 7784 conditions per place. [2024-06-03 22:42:06,222 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 414 selfloop transitions, 27 changer transitions 0/462 dead transitions. [2024-06-03 22:42:06,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 462 transitions, 8344 flow [2024-06-03 22:42:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:42:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:42:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-03 22:42:06,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37630662020905925 [2024-06-03 22:42:06,224 INFO L175 Difference]: Start difference. First operand has 317 places, 439 transitions, 7268 flow. Second operand 7 states and 108 transitions. [2024-06-03 22:42:06,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 462 transitions, 8344 flow [2024-06-03 22:42:08,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 462 transitions, 8214 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-03 22:42:08,178 INFO L231 Difference]: Finished difference. Result has 320 places, 451 transitions, 7396 flow [2024-06-03 22:42:08,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7150, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7396, PETRI_PLACES=320, PETRI_TRANSITIONS=451} [2024-06-03 22:42:08,178 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-03 22:42:08,178 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 451 transitions, 7396 flow [2024-06-03 22:42:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:08,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:08,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:08,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:42:08,179 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-03 22:42:08,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash -541821156, now seen corresponding path program 1 times [2024-06-03 22:42:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055592093] [2024-06-03 22:42:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:19,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-03 22:42:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055592093] [2024-06-03 22:42:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055592093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:42:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597196056] [2024-06-03 22:42:19,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:19,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:42:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:42:19,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:42:19,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:19,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 451 transitions, 7396 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03 22:42:19,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:19,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:19,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:22,461 INFO L124 PetriNetUnfolderBase]: 5231/8064 cut-off events. [2024-06-03 22:42:22,462 INFO L125 PetriNetUnfolderBase]: For 823812/823816 co-relation queries the response was YES. [2024-06-03 22:42:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70604 conditions, 8064 events. 5231/8064 cut-off events. For 823812/823816 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 47638 event pairs, 1416 based on Foata normal form. 6/8068 useless extension candidates. Maximal degree in co-relation 70450. Up to 8001 conditions per place. [2024-06-03 22:42:22,554 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 441 selfloop transitions, 23 changer transitions 0/467 dead transitions. [2024-06-03 22:42:22,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 467 transitions, 8430 flow [2024-06-03 22:42:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:42:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:42:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-03 22:42:22,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-03 22:42:22,556 INFO L175 Difference]: Start difference. First operand has 320 places, 451 transitions, 7396 flow. Second operand 6 states and 97 transitions. [2024-06-03 22:42:22,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 467 transitions, 8430 flow [2024-06-03 22:42:24,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 467 transitions, 8346 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-03 22:42:24,318 INFO L231 Difference]: Finished difference. Result has 322 places, 454 transitions, 7443 flow [2024-06-03 22:42:24,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7312, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7443, PETRI_PLACES=322, PETRI_TRANSITIONS=454} [2024-06-03 22:42:24,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-03 22:42:24,319 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 454 transitions, 7443 flow [2024-06-03 22:42:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03 22:42:24,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:24,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:42:24,320 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:42:24,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1282177068, now seen corresponding path program 1 times [2024-06-03 22:42:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219977195] [2024-06-03 22:42:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219977195] [2024-06-03 22:42:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219977195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:42:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178832657] [2024-06-03 22:42:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:35,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:42:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:42:35,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:42:35,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:42:35,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 454 transitions, 7443 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:35,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:35,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:42:35,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:38,590 INFO L124 PetriNetUnfolderBase]: 5114/7918 cut-off events. [2024-06-03 22:42:38,590 INFO L125 PetriNetUnfolderBase]: For 851652/851692 co-relation queries the response was YES. [2024-06-03 22:42:38,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70309 conditions, 7918 events. 5114/7918 cut-off events. For 851652/851692 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 46886 event pairs, 1391 based on Foata normal form. 10/7881 useless extension candidates. Maximal degree in co-relation 70154. Up to 7769 conditions per place. [2024-06-03 22:42:38,669 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 425 selfloop transitions, 20 changer transitions 0/466 dead transitions. [2024-06-03 22:42:38,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 466 transitions, 8391 flow [2024-06-03 22:42:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:42:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:42:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 22:42:38,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:42:38,670 INFO L175 Difference]: Start difference. First operand has 322 places, 454 transitions, 7443 flow. Second operand 6 states and 96 transitions. [2024-06-03 22:42:38,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 466 transitions, 8391 flow [2024-06-03 22:42:40,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 466 transitions, 8284 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 22:42:40,511 INFO L231 Difference]: Finished difference. Result has 324 places, 456 transitions, 7420 flow [2024-06-03 22:42:40,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7336, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7420, PETRI_PLACES=324, PETRI_TRANSITIONS=456} [2024-06-03 22:42:40,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places. [2024-06-03 22:42:40,512 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 456 transitions, 7420 flow [2024-06-03 22:42:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:42:40,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:40,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:42:40,512 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:42:40,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -823956048, now seen corresponding path program 1 times [2024-06-03 22:42:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808956146] [2024-06-03 22:42:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:42:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:42:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:42:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808956146] [2024-06-03 22:42:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808956146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:42:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:42:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:42:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689001483] [2024-06-03 22:42:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:42:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:42:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:42:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:42:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:42:49,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:42:49,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 456 transitions, 7420 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:42:49,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:42:49,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:42:49,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:42:52,049 INFO L124 PetriNetUnfolderBase]: 5261/8105 cut-off events. [2024-06-03 22:42:52,050 INFO L125 PetriNetUnfolderBase]: For 862868/862868 co-relation queries the response was YES. [2024-06-03 22:42:52,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71370 conditions, 8105 events. 5261/8105 cut-off events. For 862868/862868 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 47741 event pairs, 1383 based on Foata normal form. 4/8107 useless extension candidates. Maximal degree in co-relation 71214. Up to 7904 conditions per place. [2024-06-03 22:42:52,143 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 445 selfloop transitions, 61 changer transitions 0/509 dead transitions. [2024-06-03 22:42:52,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 509 transitions, 9091 flow [2024-06-03 22:42:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:42:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:42:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-03 22:42:52,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:42:52,145 INFO L175 Difference]: Start difference. First operand has 324 places, 456 transitions, 7420 flow. Second operand 9 states and 150 transitions. [2024-06-03 22:42:52,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 509 transitions, 9091 flow [2024-06-03 22:42:54,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 509 transitions, 9025 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 22:42:54,101 INFO L231 Difference]: Finished difference. Result has 331 places, 475 transitions, 7773 flow [2024-06-03 22:42:54,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7354, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7773, PETRI_PLACES=331, PETRI_TRANSITIONS=475} [2024-06-03 22:42:54,102 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-03 22:42:54,102 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 475 transitions, 7773 flow [2024-06-03 22:42:54,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:42:54,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:42:54,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:42:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:42:54,102 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:42:54,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:42:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 351986303, now seen corresponding path program 1 times [2024-06-03 22:42:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:42:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761795165] [2024-06-03 22:42:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:42:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:42:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761795165] [2024-06-03 22:43:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761795165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:43:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257439973] [2024-06-03 22:43:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:01,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:43:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:43:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:43:01,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:43:01,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 475 transitions, 7773 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:01,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:01,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:43:01,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:05,006 INFO L124 PetriNetUnfolderBase]: 5302/8177 cut-off events. [2024-06-03 22:43:05,006 INFO L125 PetriNetUnfolderBase]: For 909366/909370 co-relation queries the response was YES. [2024-06-03 22:43:05,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72920 conditions, 8177 events. 5302/8177 cut-off events. For 909366/909370 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 48448 event pairs, 1297 based on Foata normal form. 13/8188 useless extension candidates. Maximal degree in co-relation 72761. Up to 7921 conditions per place. [2024-06-03 22:43:05,092 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 481 selfloop transitions, 35 changer transitions 0/519 dead transitions. [2024-06-03 22:43:05,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 519 transitions, 8979 flow [2024-06-03 22:43:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:43:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:43:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-03 22:43:05,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-03 22:43:05,094 INFO L175 Difference]: Start difference. First operand has 331 places, 475 transitions, 7773 flow. Second operand 10 states and 166 transitions. [2024-06-03 22:43:05,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 519 transitions, 8979 flow [2024-06-03 22:43:06,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 519 transitions, 8889 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-03 22:43:06,822 INFO L231 Difference]: Finished difference. Result has 337 places, 476 transitions, 7805 flow [2024-06-03 22:43:06,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7685, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7805, PETRI_PLACES=337, PETRI_TRANSITIONS=476} [2024-06-03 22:43:06,823 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 295 predicate places. [2024-06-03 22:43:06,823 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 476 transitions, 7805 flow [2024-06-03 22:43:06,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:06,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:06,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:43:06,823 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:43:06,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1536053185, now seen corresponding path program 2 times [2024-06-03 22:43:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:06,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234829393] [2024-06-03 22:43:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:15,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:15,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234829393] [2024-06-03 22:43:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234829393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:15,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:43:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914855551] [2024-06-03 22:43:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:43:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:43:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:43:15,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:43:15,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 476 transitions, 7805 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:15,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:15,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:43:15,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:19,473 INFO L124 PetriNetUnfolderBase]: 5675/8772 cut-off events. [2024-06-03 22:43:19,474 INFO L125 PetriNetUnfolderBase]: For 1113616/1113620 co-relation queries the response was YES. [2024-06-03 22:43:19,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78650 conditions, 8772 events. 5675/8772 cut-off events. For 1113616/1113620 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52616 event pairs, 1343 based on Foata normal form. 58/8828 useless extension candidates. Maximal degree in co-relation 78490. Up to 7971 conditions per place. [2024-06-03 22:43:19,577 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 476 selfloop transitions, 82 changer transitions 0/561 dead transitions. [2024-06-03 22:43:19,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 561 transitions, 9885 flow [2024-06-03 22:43:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-03 22:43:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-03 22:43:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 255 transitions. [2024-06-03 22:43:19,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:43:19,578 INFO L175 Difference]: Start difference. First operand has 337 places, 476 transitions, 7805 flow. Second operand 15 states and 255 transitions. [2024-06-03 22:43:19,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 561 transitions, 9885 flow [2024-06-03 22:43:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 561 transitions, 9779 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-03 22:43:21,584 INFO L231 Difference]: Finished difference. Result has 346 places, 488 transitions, 8162 flow [2024-06-03 22:43:21,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7699, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8162, PETRI_PLACES=346, PETRI_TRANSITIONS=488} [2024-06-03 22:43:21,584 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places. [2024-06-03 22:43:21,584 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 488 transitions, 8162 flow [2024-06-03 22:43:21,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:21,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:21,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:21,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:43:21,585 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:43:21,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1536283825, now seen corresponding path program 3 times [2024-06-03 22:43:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727122447] [2024-06-03 22:43:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727122447] [2024-06-03 22:43:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727122447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:43:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274162408] [2024-06-03 22:43:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:43:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:43:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:43:30,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:43:30,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 488 transitions, 8162 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:30,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:30,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:43:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:34,534 INFO L124 PetriNetUnfolderBase]: 6137/9514 cut-off events. [2024-06-03 22:43:34,534 INFO L125 PetriNetUnfolderBase]: For 1268993/1268997 co-relation queries the response was YES. [2024-06-03 22:43:34,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87349 conditions, 9514 events. 6137/9514 cut-off events. For 1268993/1268997 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57996 event pairs, 1443 based on Foata normal form. 58/9570 useless extension candidates. Maximal degree in co-relation 87186. Up to 8327 conditions per place. [2024-06-03 22:43:34,631 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 478 selfloop transitions, 91 changer transitions 0/572 dead transitions. [2024-06-03 22:43:34,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 572 transitions, 10330 flow [2024-06-03 22:43:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-03 22:43:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-03 22:43:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 247 transitions. [2024-06-03 22:43:34,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43031358885017423 [2024-06-03 22:43:34,633 INFO L175 Difference]: Start difference. First operand has 346 places, 488 transitions, 8162 flow. Second operand 14 states and 247 transitions. [2024-06-03 22:43:34,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 572 transitions, 10330 flow [2024-06-03 22:43:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 572 transitions, 10138 flow, removed 53 selfloop flow, removed 9 redundant places. [2024-06-03 22:43:36,448 INFO L231 Difference]: Finished difference. Result has 352 places, 494 transitions, 8379 flow [2024-06-03 22:43:36,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7970, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8379, PETRI_PLACES=352, PETRI_TRANSITIONS=494} [2024-06-03 22:43:36,449 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 310 predicate places. [2024-06-03 22:43:36,449 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 494 transitions, 8379 flow [2024-06-03 22:43:36,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:36,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:36,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:36,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:43:36,450 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:43:36,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1051228616, now seen corresponding path program 2 times [2024-06-03 22:43:36,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:36,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177985134] [2024-06-03 22:43:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:45,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-03 22:43:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177985134] [2024-06-03 22:43:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177985134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:43:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960685582] [2024-06-03 22:43:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:45,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:43:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:43:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:43:45,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:43:45,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 494 transitions, 8379 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:43:45,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:45,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:43:45,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:49,212 INFO L124 PetriNetUnfolderBase]: 6163/9549 cut-off events. [2024-06-03 22:43:49,212 INFO L125 PetriNetUnfolderBase]: For 1168243/1168243 co-relation queries the response was YES. [2024-06-03 22:43:49,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88395 conditions, 9549 events. 6163/9549 cut-off events. For 1168243/1168243 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 58326 event pairs, 1893 based on Foata normal form. 2/9549 useless extension candidates. Maximal degree in co-relation 88229. Up to 9333 conditions per place. [2024-06-03 22:43:49,339 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 458 selfloop transitions, 69 changer transitions 0/530 dead transitions. [2024-06-03 22:43:49,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 530 transitions, 9945 flow [2024-06-03 22:43:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:43:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:43:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-03 22:43:49,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-03 22:43:49,341 INFO L175 Difference]: Start difference. First operand has 352 places, 494 transitions, 8379 flow. Second operand 9 states and 145 transitions. [2024-06-03 22:43:49,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 530 transitions, 9945 flow [2024-06-03 22:43:51,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 530 transitions, 9771 flow, removed 38 selfloop flow, removed 9 redundant places. [2024-06-03 22:43:51,653 INFO L231 Difference]: Finished difference. Result has 353 places, 504 transitions, 8510 flow [2024-06-03 22:43:51,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8206, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8510, PETRI_PLACES=353, PETRI_TRANSITIONS=504} [2024-06-03 22:43:51,653 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 311 predicate places. [2024-06-03 22:43:51,653 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 504 transitions, 8510 flow [2024-06-03 22:43:51,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:43:51,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:51,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:43:51,654 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:43:51,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -814701618, now seen corresponding path program 3 times [2024-06-03 22:43:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060818592] [2024-06-03 22:43:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060818592] [2024-06-03 22:44:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060818592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:00,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360085944] [2024-06-03 22:44:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:01,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:44:01,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 504 transitions, 8510 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:44:01,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:01,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:44:01,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:04,311 INFO L124 PetriNetUnfolderBase]: 6147/9527 cut-off events. [2024-06-03 22:44:04,311 INFO L125 PetriNetUnfolderBase]: For 1177947/1177947 co-relation queries the response was YES. [2024-06-03 22:44:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87778 conditions, 9527 events. 6147/9527 cut-off events. For 1177947/1177947 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 58104 event pairs, 1843 based on Foata normal form. 4/9529 useless extension candidates. Maximal degree in co-relation 87609. Up to 9320 conditions per place. [2024-06-03 22:44:04,435 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 462 selfloop transitions, 65 changer transitions 0/530 dead transitions. [2024-06-03 22:44:04,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 530 transitions, 9812 flow [2024-06-03 22:44:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-03 22:44:04,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-03 22:44:04,437 INFO L175 Difference]: Start difference. First operand has 353 places, 504 transitions, 8510 flow. Second operand 9 states and 145 transitions. [2024-06-03 22:44:04,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 530 transitions, 9812 flow [2024-06-03 22:44:06,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 530 transitions, 9701 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:06,960 INFO L231 Difference]: Finished difference. Result has 358 places, 504 transitions, 8539 flow [2024-06-03 22:44:06,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8399, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8539, PETRI_PLACES=358, PETRI_TRANSITIONS=504} [2024-06-03 22:44:06,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 316 predicate places. [2024-06-03 22:44:06,960 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 504 transitions, 8539 flow [2024-06-03 22:44:06,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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-03 22:44:06,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:06,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:06,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:44:06,961 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:44:06,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1541738881, now seen corresponding path program 4 times [2024-06-03 22:44:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062542085] [2024-06-03 22:44:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062542085] [2024-06-03 22:44:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062542085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:44:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930263806] [2024-06-03 22:44:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:14,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:44:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:44:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:44:15,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:44:15,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 504 transitions, 8539 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-03 22:44:15,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:15,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:44:15,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:18,443 INFO L124 PetriNetUnfolderBase]: 6188/9599 cut-off events. [2024-06-03 22:44:18,443 INFO L125 PetriNetUnfolderBase]: For 1228147/1228151 co-relation queries the response was YES. [2024-06-03 22:44:18,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88613 conditions, 9599 events. 6188/9599 cut-off events. For 1228147/1228151 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 58766 event pairs, 1885 based on Foata normal form. 16/9613 useless extension candidates. Maximal degree in co-relation 88443. Up to 9439 conditions per place. [2024-06-03 22:44:18,557 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 518 selfloop transitions, 18 changer transitions 0/539 dead transitions. [2024-06-03 22:44:18,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 539 transitions, 9765 flow [2024-06-03 22:44:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-03 22:44:18,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-03 22:44:18,560 INFO L175 Difference]: Start difference. First operand has 358 places, 504 transitions, 8539 flow. Second operand 9 states and 142 transitions. [2024-06-03 22:44:18,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 539 transitions, 9765 flow [2024-06-03 22:44:21,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 539 transitions, 9683 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:21,338 INFO L231 Difference]: Finished difference. Result has 362 places, 505 transitions, 8551 flow [2024-06-03 22:44:21,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8459, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8551, PETRI_PLACES=362, PETRI_TRANSITIONS=505} [2024-06-03 22:44:21,339 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 320 predicate places. [2024-06-03 22:44:21,339 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 505 transitions, 8551 flow [2024-06-03 22:44:21,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-03 22:44:21,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:21,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:44:21,339 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:44:21,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2078935267, now seen corresponding path program 5 times [2024-06-03 22:44:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295862164] [2024-06-03 22:44:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295862164] [2024-06-03 22:44:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295862164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:44:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607856178] [2024-06-03 22:44:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:29,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:44:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:44:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:44:29,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:44:29,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 505 transitions, 8551 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:29,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:29,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:44:29,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:33,088 INFO L124 PetriNetUnfolderBase]: 6229/9670 cut-off events. [2024-06-03 22:44:33,088 INFO L125 PetriNetUnfolderBase]: For 1263258/1263262 co-relation queries the response was YES. [2024-06-03 22:44:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89415 conditions, 9670 events. 6229/9670 cut-off events. For 1263258/1263262 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 59389 event pairs, 1843 based on Foata normal form. 16/9684 useless extension candidates. Maximal degree in co-relation 89245. Up to 9396 conditions per place. [2024-06-03 22:44:33,184 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 505 selfloop transitions, 32 changer transitions 0/540 dead transitions. [2024-06-03 22:44:33,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 540 transitions, 9777 flow [2024-06-03 22:44:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-03 22:44:33,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:44:33,186 INFO L175 Difference]: Start difference. First operand has 362 places, 505 transitions, 8551 flow. Second operand 9 states and 144 transitions. [2024-06-03 22:44:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 540 transitions, 9777 flow [2024-06-03 22:44:35,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 540 transitions, 9699 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:35,809 INFO L231 Difference]: Finished difference. Result has 364 places, 506 transitions, 8595 flow [2024-06-03 22:44:35,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8473, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8595, PETRI_PLACES=364, PETRI_TRANSITIONS=506} [2024-06-03 22:44:35,810 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 322 predicate places. [2024-06-03 22:44:35,810 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 506 transitions, 8595 flow [2024-06-03 22:44:35,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:35,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:35,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:35,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:44:35,810 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:44:35,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash 115231757, now seen corresponding path program 6 times [2024-06-03 22:44:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901797591] [2024-06-03 22:44:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901797591] [2024-06-03 22:44:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901797591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750734183] [2024-06-03 22:44:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:42,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:44:42,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 506 transitions, 8595 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:42,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:42,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:44:42,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:46,361 INFO L124 PetriNetUnfolderBase]: 6270/9741 cut-off events. [2024-06-03 22:44:46,361 INFO L125 PetriNetUnfolderBase]: For 1293043/1293047 co-relation queries the response was YES. [2024-06-03 22:44:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90159 conditions, 9741 events. 6270/9741 cut-off events. For 1293043/1293047 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 59921 event pairs, 1848 based on Foata normal form. 16/9755 useless extension candidates. Maximal degree in co-relation 89988. Up to 9567 conditions per place. [2024-06-03 22:44:46,470 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 523 selfloop transitions, 18 changer transitions 0/544 dead transitions. [2024-06-03 22:44:46,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 544 transitions, 9845 flow [2024-06-03 22:44:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-03 22:44:46,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:44:46,472 INFO L175 Difference]: Start difference. First operand has 364 places, 506 transitions, 8595 flow. Second operand 9 states and 150 transitions. [2024-06-03 22:44:46,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 544 transitions, 9845 flow [2024-06-03 22:44:49,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 544 transitions, 9737 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:49,065 INFO L231 Difference]: Finished difference. Result has 369 places, 510 transitions, 8614 flow [2024-06-03 22:44:49,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8487, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8614, PETRI_PLACES=369, PETRI_TRANSITIONS=510} [2024-06-03 22:44:49,066 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 327 predicate places. [2024-06-03 22:44:49,066 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 510 transitions, 8614 flow [2024-06-03 22:44:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:49,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:49,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:49,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:44:49,067 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:44:49,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 498646975, now seen corresponding path program 7 times [2024-06-03 22:44:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314018494] [2024-06-03 22:44:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314018494] [2024-06-03 22:44:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314018494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:56,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:56,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:44:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210616454] [2024-06-03 22:44:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:56,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:44:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:44:56,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:44:56,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:44:56,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 510 transitions, 8614 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:56,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:56,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:44:56,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:00,413 INFO L124 PetriNetUnfolderBase]: 6311/9812 cut-off events. [2024-06-03 22:45:00,413 INFO L125 PetriNetUnfolderBase]: For 1326172/1326176 co-relation queries the response was YES. [2024-06-03 22:45:00,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90813 conditions, 9812 events. 6311/9812 cut-off events. For 1326172/1326176 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 60630 event pairs, 1872 based on Foata normal form. 13/9823 useless extension candidates. Maximal degree in co-relation 90638. Up to 9545 conditions per place. [2024-06-03 22:45:00,542 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 511 selfloop transitions, 35 changer transitions 0/549 dead transitions. [2024-06-03 22:45:00,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 549 transitions, 9876 flow [2024-06-03 22:45:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-03 22:45:00,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-03 22:45:00,544 INFO L175 Difference]: Start difference. First operand has 369 places, 510 transitions, 8614 flow. Second operand 9 states and 160 transitions. [2024-06-03 22:45:00,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 549 transitions, 9876 flow [2024-06-03 22:45:03,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 549 transitions, 9803 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-03 22:45:03,340 INFO L231 Difference]: Finished difference. Result has 374 places, 511 transitions, 8673 flow [2024-06-03 22:45:03,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8541, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8673, PETRI_PLACES=374, PETRI_TRANSITIONS=511} [2024-06-03 22:45:03,341 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 332 predicate places. [2024-06-03 22:45:03,341 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 511 transitions, 8673 flow [2024-06-03 22:45:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:03,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:03,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:45:03,342 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:45:03,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -489862735, now seen corresponding path program 8 times [2024-06-03 22:45:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875167206] [2024-06-03 22:45:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15