./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.opt_pso.opt_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/safe030_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 18:10:44,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 18:10:44,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 18:10:44,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 18:10:44,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 18:10:44,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 18:10:44,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 18:10:44,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 18:10:44,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 18:10:44,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 18:10:44,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 18:10:44,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 18:10:44,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 18:10:44,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 18:10:44,120 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 18:10:44,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 18:10:44,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 18:10:44,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 18:10:44,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 18:10:44,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 18:10:44,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 18:10:44,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 18:10:44,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 18:10:44,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 18:10:44,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 18:10:44,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 18:10:44,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 18:10:44,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 18:10:44,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 18:10:44,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 18:10:44,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 18:10:44,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 18:10:44,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:10:44,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 18:10:44,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 18:10:44,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 18:10:44,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 18:10:44,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 18:10:44,133 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-04 18:10:44,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 18:10:44,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 18:10:44,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 18:10:44,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 18:10:44,355 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 18:10:44,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:10:45,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 18:10:45,588 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 18:10:45,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:10:45,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aaef199f/bdba90d97e1541da9e629e59286f38e1/FLAG1ee68c831 [2024-06-04 18:10:45,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aaef199f/bdba90d97e1541da9e629e59286f38e1 [2024-06-04 18:10:45,614 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 18:10:45,614 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 18:10:45,614 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/safe030_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-04 18:10:45,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 18:10:45,754 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 18:10:45,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 18:10:45,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 18:10:45,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 18:10:45,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:10:45" (1/2) ... [2024-06-04 18:10:45,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d246c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:10:45, skipping insertion in model container [2024-06-04 18:10:45,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:10:45" (1/2) ... [2024-06-04 18:10:45,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61063e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:10:45, skipping insertion in model container [2024-06-04 18:10:45,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:10:45" (2/2) ... [2024-06-04 18:10:45,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d246c3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:45, skipping insertion in model container [2024-06-04 18:10:45,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:10:45" (2/2) ... [2024-06-04 18:10:45,763 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 18:10:45,824 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 18:10:45,825 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-04 18:10:45,826 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-04 18:10:45,826 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-04 18:10:45,827 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 18:10:45,827 INFO L106 edCorrectnessWitness]: ghost_update [L812-L812] multithreaded = 1; [2024-06-04 18:10:45,865 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 18:10:46,122 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:10:46,136 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 18:10:46,446 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:10:46,480 INFO L206 MainTranslator]: Completed translation [2024-06-04 18:10:46,481 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46 WrapperNode [2024-06-04 18:10:46,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 18:10:46,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 18:10:46,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 18:10:46,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 18:10:46,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,607 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2024-06-04 18:10:46,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 18:10:46,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 18:10:46,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 18:10:46,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 18:10:46,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,698 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-04 18:10:46,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 18:10:46,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 18:10:46,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 18:10:46,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 18:10:46,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (1/1) ... [2024-06-04 18:10:46,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:10:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 18:10:46,821 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-04 18:10:46,837 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-04 18:10:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 18:10:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 18:10:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 18:10:46,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 18:10:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 18:10:46,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 18:10:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 18:10:46,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 18:10:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 18:10:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 18:10:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 18:10:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 18:10:46,854 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 18:10:46,970 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 18:10:46,972 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 18:10:47,973 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 18:10:47,975 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 18:10:48,213 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 18:10:48,213 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 18:10:48,214 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:10:48 BoogieIcfgContainer [2024-06-04 18:10:48,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 18:10:48,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 18:10:48,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 18:10:48,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 18:10:48,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:10:45" (1/4) ... [2024-06-04 18:10:48,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e30634c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:10:48, skipping insertion in model container [2024-06-04 18:10:48,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:10:45" (2/4) ... [2024-06-04 18:10:48,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e30634c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:10:48, skipping insertion in model container [2024-06-04 18:10:48,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:10:46" (3/4) ... [2024-06-04 18:10:48,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e30634c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:10:48, skipping insertion in model container [2024-06-04 18:10:48,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:10:48" (4/4) ... [2024-06-04 18:10:48,223 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:10:48,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 18:10:48,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 18:10:48,236 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 18:10:48,319 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 18:10:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 18:10:48,398 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 18:10:48,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:10:48,401 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 61 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-04 18:10:48,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 18:10:48,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 18:10:48,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 18:10:48,422 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;@52a5348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 18:10:48,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 18:10:48,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 18:10:48,428 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 18:10:48,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:10:48,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:48,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 18:10:48,429 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-04 18:10:48,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1778898873, now seen corresponding path program 1 times [2024-06-04 18:10:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044960139] [2024-06-04 18:10:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044960139] [2024-06-04 18:10:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044960139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 18:10:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207936976] [2024-06-04 18:10:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:52,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 18:10:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 18:10:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 18:10:52,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-04 18:10:52,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:52,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:52,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-04 18:10:52,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:53,249 INFO L124 PetriNetUnfolderBase]: 736/1235 cut-off events. [2024-06-04 18:10:53,249 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-04 18:10:53,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 1235 events. 736/1235 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6398 event pairs, 471 based on Foata normal form. 1/1203 useless extension candidates. Maximal degree in co-relation 2407. Up to 1122 conditions per place. [2024-06-04 18:10:53,262 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-04 18:10:53,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 169 flow [2024-06-04 18:10:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 18:10:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 18:10:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-04 18:10:53,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-06-04 18:10:53,273 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 74 transitions. [2024-06-04 18:10:53,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 169 flow [2024-06-04 18:10:53,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:53,277 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-04 18:10:53,279 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-04 18:10:53,282 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-04 18:10:53,282 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-04 18:10:53,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:53,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:53,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:53,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 18:10:53,283 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-04 18:10:53,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -124806554, now seen corresponding path program 1 times [2024-06-04 18:10:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577711407] [2024-06-04 18:10:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577711407] [2024-06-04 18:10:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577711407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:56,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 18:10:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164956265] [2024-06-04 18:10:56,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:56,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 18:10:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 18:10:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 18:10:56,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-04 18:10:56,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:56,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:56,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-04 18:10:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:56,986 INFO L124 PetriNetUnfolderBase]: 730/1226 cut-off events. [2024-06-04 18:10:56,986 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-06-04 18:10:56,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 1226 events. 730/1226 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6340 event pairs, 365 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 2748. Up to 1098 conditions per place. [2024-06-04 18:10:56,992 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-04 18:10:56,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 236 flow [2024-06-04 18:10:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 18:10:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 18:10:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-04 18:10:56,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-04 18:10:56,996 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 96 transitions. [2024-06-04 18:10:56,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 236 flow [2024-06-04 18:10:56,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 18:10:56,999 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-04 18:10:57,000 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-04 18:10:57,000 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-04 18:10:57,000 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-04 18:10:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:57,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:57,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:57,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 18:10:57,003 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-04 18:10:57,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 425965014, now seen corresponding path program 1 times [2024-06-04 18:10:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290524735] [2024-06-04 18:10:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:59,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290524735] [2024-06-04 18:10:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290524735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 18:10:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326606219] [2024-06-04 18:10:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:59,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 18:10:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 18:10:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 18:10:59,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-04 18:10:59,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-04 18:10:59,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:59,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-04 18:10:59,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:00,373 INFO L124 PetriNetUnfolderBase]: 742/1259 cut-off events. [2024-06-04 18:11:00,374 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-04 18:11:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 1259 events. 742/1259 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6608 event pairs, 169 based on Foata normal form. 10/1262 useless extension candidates. Maximal degree in co-relation 3145. Up to 1008 conditions per place. [2024-06-04 18:11:00,382 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2024-06-04 18:11:00,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 368 flow [2024-06-04 18:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:11:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:11:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-06-04 18:11:00,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5951219512195122 [2024-06-04 18:11:00,387 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 122 transitions. [2024-06-04 18:11:00,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 368 flow [2024-06-04 18:11:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 354 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 18:11:00,391 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 215 flow [2024-06-04 18:11:00,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-06-04 18:11:00,392 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-04 18:11:00,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 215 flow [2024-06-04 18:11:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-04 18:11:00,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:00,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:00,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 18:11:00,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:00,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:00,394 INFO L85 PathProgramCache]: Analyzing trace with hash 921517780, now seen corresponding path program 1 times [2024-06-04 18:11:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:00,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712276040] [2024-06-04 18:11:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:07,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712276040] [2024-06-04 18:11:07,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712276040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:07,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:11:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787359882] [2024-06-04 18:11:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:07,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:11:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:11:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:11:07,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:07,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:07,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:07,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:07,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:08,357 INFO L124 PetriNetUnfolderBase]: 1368/2073 cut-off events. [2024-06-04 18:11:08,357 INFO L125 PetriNetUnfolderBase]: For 2528/2528 co-relation queries the response was YES. [2024-06-04 18:11:08,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6160 conditions, 2073 events. 1368/2073 cut-off events. For 2528/2528 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9619 event pairs, 657 based on Foata normal form. 2/2072 useless extension candidates. Maximal degree in co-relation 6140. Up to 2036 conditions per place. [2024-06-04 18:11:08,368 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-04 18:11:08,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 349 flow [2024-06-04 18:11:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:11:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:11:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 18:11:08,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-04 18:11:08,370 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 215 flow. Second operand 5 states and 86 transitions. [2024-06-04 18:11:08,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 349 flow [2024-06-04 18:11:08,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 339 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-04 18:11:08,373 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 229 flow [2024-06-04 18:11:08,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-04 18:11:08,374 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-04 18:11:08,374 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 229 flow [2024-06-04 18:11:08,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:08,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:08,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:08,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 18:11:08,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:08,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1508817884, now seen corresponding path program 1 times [2024-06-04 18:11:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982321619] [2024-06-04 18:11:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:15,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982321619] [2024-06-04 18:11:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982321619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:15,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:11:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543534169] [2024-06-04 18:11:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:15,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:11:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:11:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:11:15,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:15,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:15,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:15,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:16,524 INFO L124 PetriNetUnfolderBase]: 1358/2059 cut-off events. [2024-06-04 18:11:16,525 INFO L125 PetriNetUnfolderBase]: For 3249/3249 co-relation queries the response was YES. [2024-06-04 18:11:16,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6281 conditions, 2059 events. 1358/2059 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9545 event pairs, 621 based on Foata normal form. 4/2060 useless extension candidates. Maximal degree in co-relation 6257. Up to 2004 conditions per place. [2024-06-04 18:11:16,537 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-04 18:11:16,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 407 flow [2024-06-04 18:11:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:11:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:11:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 18:11:16,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:11:16,539 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 229 flow. Second operand 6 states and 102 transitions. [2024-06-04 18:11:16,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 407 flow [2024-06-04 18:11:16,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 385 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 18:11:16,547 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 259 flow [2024-06-04 18:11:16,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-04 18:11:16,549 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-04 18:11:16,549 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 259 flow [2024-06-04 18:11:16,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:16,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:16,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:16,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 18:11:16,551 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-04 18:11:16,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash 465565585, now seen corresponding path program 1 times [2024-06-04 18:11:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347182819] [2024-06-04 18:11:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347182819] [2024-06-04 18:11:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347182819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:11:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986561884] [2024-06-04 18:11:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:11:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:11:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:11:23,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:23,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:23,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:23,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:23,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:24,734 INFO L124 PetriNetUnfolderBase]: 1364/2069 cut-off events. [2024-06-04 18:11:24,735 INFO L125 PetriNetUnfolderBase]: For 4521/4527 co-relation queries the response was YES. [2024-06-04 18:11:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 2069 events. 1364/2069 cut-off events. For 4521/4527 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9683 event pairs, 509 based on Foata normal form. 8/2073 useless extension candidates. Maximal degree in co-relation 6784. Up to 1956 conditions per place. [2024-06-04 18:11:24,747 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-04 18:11:24,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 535 flow [2024-06-04 18:11:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:11:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:11:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 18:11:24,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-04 18:11:24,749 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 259 flow. Second operand 6 states and 110 transitions. [2024-06-04 18:11:24,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 535 flow [2024-06-04 18:11:24,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 507 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 18:11:24,754 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 360 flow [2024-06-04 18:11:24,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-04 18:11:24,756 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-04 18:11:24,756 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 360 flow [2024-06-04 18:11:24,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:24,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:24,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:24,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 18:11:24,757 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-04 18:11:24,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 815365555, now seen corresponding path program 2 times [2024-06-04 18:11:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232840702] [2024-06-04 18:11:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:31,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232840702] [2024-06-04 18:11:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232840702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:31,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:11:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653105102] [2024-06-04 18:11:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:31,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:11:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:11:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:11:31,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:31,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:31,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:31,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:31,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:32,538 INFO L124 PetriNetUnfolderBase]: 1352/2042 cut-off events. [2024-06-04 18:11:32,539 INFO L125 PetriNetUnfolderBase]: For 5807/5813 co-relation queries the response was YES. [2024-06-04 18:11:32,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 2042 events. 1352/2042 cut-off events. For 5807/5813 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9478 event pairs, 523 based on Foata normal form. 3/2036 useless extension candidates. Maximal degree in co-relation 7135. Up to 1940 conditions per place. [2024-06-04 18:11:32,551 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 50 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2024-06-04 18:11:32,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 538 flow [2024-06-04 18:11:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:11:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:11:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 18:11:32,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 18:11:32,553 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 360 flow. Second operand 6 states and 106 transitions. [2024-06-04 18:11:32,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 538 flow [2024-06-04 18:11:32,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 522 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 18:11:32,558 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 392 flow [2024-06-04 18:11:32,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-04 18:11:32,559 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-04 18:11:32,559 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 392 flow [2024-06-04 18:11:32,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:32,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:32,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:32,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 18:11:32,560 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-04 18:11:32,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 862832357, now seen corresponding path program 1 times [2024-06-04 18:11:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957060521] [2024-06-04 18:11:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957060521] [2024-06-04 18:11:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957060521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38709882] [2024-06-04 18:11:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:39,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:39,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:39,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 392 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-04 18:11:39,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:39,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:40,629 INFO L124 PetriNetUnfolderBase]: 1526/2308 cut-off events. [2024-06-04 18:11:40,629 INFO L125 PetriNetUnfolderBase]: For 7988/7994 co-relation queries the response was YES. [2024-06-04 18:11:40,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 2308 events. 1526/2308 cut-off events. For 7988/7994 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10815 event pairs, 513 based on Foata normal form. 12/2316 useless extension candidates. Maximal degree in co-relation 8555. Up to 2040 conditions per place. [2024-06-04 18:11:40,641 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 76 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-06-04 18:11:40,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 972 flow [2024-06-04 18:11:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 18:11:40,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:11:40,644 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 392 flow. Second operand 9 states and 162 transitions. [2024-06-04 18:11:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 972 flow [2024-06-04 18:11:40,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 913 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 18:11:40,651 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 675 flow [2024-06-04 18:11:40,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=675, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2024-06-04 18:11:40,651 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-06-04 18:11:40,651 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 675 flow [2024-06-04 18:11:40,652 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-04 18:11:40,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:40,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:40,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 18:11:40,652 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-04 18:11:40,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1547632805, now seen corresponding path program 2 times [2024-06-04 18:11:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972731176] [2024-06-04 18:11:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972731176] [2024-06-04 18:11:48,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972731176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:48,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341928731] [2024-06-04 18:11:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:48,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:48,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 675 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-04 18:11:48,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:48,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:48,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:49,221 INFO L124 PetriNetUnfolderBase]: 1598/2426 cut-off events. [2024-06-04 18:11:49,221 INFO L125 PetriNetUnfolderBase]: For 11177/11185 co-relation queries the response was YES. [2024-06-04 18:11:49,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 2426 events. 1598/2426 cut-off events. For 11177/11185 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11542 event pairs, 431 based on Foata normal form. 16/2438 useless extension candidates. Maximal degree in co-relation 9882. Up to 1988 conditions per place. [2024-06-04 18:11:49,236 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 71 selfloop transitions, 54 changer transitions 0/129 dead transitions. [2024-06-04 18:11:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 1149 flow [2024-06-04 18:11:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-04 18:11:49,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-04 18:11:49,238 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 675 flow. Second operand 9 states and 160 transitions. [2024-06-04 18:11:49,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 1149 flow [2024-06-04 18:11:49,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 1117 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-04 18:11:49,249 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 857 flow [2024-06-04 18:11:49,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=857, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-06-04 18:11:49,250 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-04 18:11:49,250 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 857 flow [2024-06-04 18:11:49,250 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-04 18:11:49,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:49,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 18:11:49,250 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-04 18:11:49,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -493232863, now seen corresponding path program 3 times [2024-06-04 18:11:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898275680] [2024-06-04 18:11:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:57,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898275680] [2024-06-04 18:11:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898275680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649668394] [2024-06-04 18:11:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:57,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:57,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:57,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:11:57,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 857 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-04 18:11:57,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:57,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:11:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:58,016 INFO L124 PetriNetUnfolderBase]: 1620/2453 cut-off events. [2024-06-04 18:11:58,016 INFO L125 PetriNetUnfolderBase]: For 14392/14400 co-relation queries the response was YES. [2024-06-04 18:11:58,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10970 conditions, 2453 events. 1620/2453 cut-off events. For 14392/14400 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11658 event pairs, 442 based on Foata normal form. 5/2444 useless extension candidates. Maximal degree in co-relation 10935. Up to 1997 conditions per place. [2024-06-04 18:11:58,030 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 62 changer transitions 0/132 dead transitions. [2024-06-04 18:11:58,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 1359 flow [2024-06-04 18:11:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 18:11:58,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 18:11:58,049 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 857 flow. Second operand 8 states and 145 transitions. [2024-06-04 18:11:58,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 1359 flow [2024-06-04 18:11:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 1256 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:58,071 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 980 flow [2024-06-04 18:11:58,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=980, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2024-06-04 18:11:58,072 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 18:11:58,075 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 980 flow [2024-06-04 18:11:58,075 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-04 18:11:58,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:58,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 18:11:58,076 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-04 18:11:58,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 895909709, now seen corresponding path program 4 times [2024-06-04 18:11:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644785032] [2024-06-04 18:11:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:05,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644785032] [2024-06-04 18:12:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644785032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:12:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607760291] [2024-06-04 18:12:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:05,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:12:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:12:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:12:05,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:05,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 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-04 18:12:05,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:05,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:05,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:06,671 INFO L124 PetriNetUnfolderBase]: 1604/2426 cut-off events. [2024-06-04 18:12:06,671 INFO L125 PetriNetUnfolderBase]: For 13660/13668 co-relation queries the response was YES. [2024-06-04 18:12:06,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 2426 events. 1604/2426 cut-off events. For 13660/13668 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11453 event pairs, 439 based on Foata normal form. 7/2419 useless extension candidates. Maximal degree in co-relation 10732. Up to 1990 conditions per place. [2024-06-04 18:12:06,685 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 72 selfloop transitions, 63 changer transitions 0/139 dead transitions. [2024-06-04 18:12:06,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 1400 flow [2024-06-04 18:12:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:12:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:12:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-04 18:12:06,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-04 18:12:06,688 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 980 flow. Second operand 10 states and 174 transitions. [2024-06-04 18:12:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 1400 flow [2024-06-04 18:12:06,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 139 transitions, 1327 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-04 18:12:06,704 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 1044 flow [2024-06-04 18:12:06,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1044, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-04 18:12:06,704 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-04 18:12:06,704 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 1044 flow [2024-06-04 18:12:06,705 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-04 18:12:06,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:06,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:06,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 18:12:06,705 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-04 18:12:06,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash -853397125, now seen corresponding path program 1 times [2024-06-04 18:12:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262496562] [2024-06-04 18:12:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262496562] [2024-06-04 18:12:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262496562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122149935] [2024-06-04 18:12:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:14,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:14,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:14,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:14,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:14,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 1044 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-04 18:12:14,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:14,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:14,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:15,287 INFO L124 PetriNetUnfolderBase]: 1596/2426 cut-off events. [2024-06-04 18:12:15,287 INFO L125 PetriNetUnfolderBase]: For 15575/15577 co-relation queries the response was YES. [2024-06-04 18:12:15,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11164 conditions, 2426 events. 1596/2426 cut-off events. For 15575/15577 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11512 event pairs, 486 based on Foata normal form. 4/2427 useless extension candidates. Maximal degree in co-relation 11125. Up to 2329 conditions per place. [2024-06-04 18:12:15,304 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 107 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2024-06-04 18:12:15,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 1366 flow [2024-06-04 18:12:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:12:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:12:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 18:12:15,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 18:12:15,306 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 1044 flow. Second operand 7 states and 117 transitions. [2024-06-04 18:12:15,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 1366 flow [2024-06-04 18:12:15,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 1193 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 18:12:15,324 INFO L231 Difference]: Finished difference. Result has 86 places, 103 transitions, 928 flow [2024-06-04 18:12:15,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=928, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2024-06-04 18:12:15,324 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-04 18:12:15,325 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 928 flow [2024-06-04 18:12:15,325 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-04 18:12:15,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:15,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:15,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 18:12:15,325 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:12:15,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash 677561842, now seen corresponding path program 1 times [2024-06-04 18:12:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136420926] [2024-06-04 18:12:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136420926] [2024-06-04 18:12:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136420926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:12:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553771378] [2024-06-04 18:12:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:21,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:12:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:12:21,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:12:21,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:21,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:21,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:21,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:21,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:22,432 INFO L124 PetriNetUnfolderBase]: 1593/2418 cut-off events. [2024-06-04 18:12:22,432 INFO L125 PetriNetUnfolderBase]: For 16228/16230 co-relation queries the response was YES. [2024-06-04 18:12:22,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 2418 events. 1593/2418 cut-off events. For 16228/16230 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11433 event pairs, 518 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 10969. Up to 2367 conditions per place. [2024-06-04 18:12:22,447 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-06-04 18:12:22,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1192 flow [2024-06-04 18:12:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:12:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:12:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-04 18:12:22,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 18:12:22,448 INFO L175 Difference]: Start difference. First operand has 86 places, 103 transitions, 928 flow. Second operand 5 states and 82 transitions. [2024-06-04 18:12:22,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1192 flow [2024-06-04 18:12:22,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 1153 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 18:12:22,466 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 937 flow [2024-06-04 18:12:22,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=937, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2024-06-04 18:12:22,467 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-04 18:12:22,467 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 937 flow [2024-06-04 18:12:22,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:22,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:22,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:22,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 18:12:22,468 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-04 18:12:22,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1859508045, now seen corresponding path program 1 times [2024-06-04 18:12:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682851313] [2024-06-04 18:12:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682851313] [2024-06-04 18:12:29,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682851313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:12:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901629678] [2024-06-04 18:12:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:29,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:12:29,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:12:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:12:29,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:29,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 937 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:29,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:29,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:29,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:30,248 INFO L124 PetriNetUnfolderBase]: 1669/2549 cut-off events. [2024-06-04 18:12:30,248 INFO L125 PetriNetUnfolderBase]: For 19207/19212 co-relation queries the response was YES. [2024-06-04 18:12:30,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11904 conditions, 2549 events. 1669/2549 cut-off events. For 19207/19212 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12311 event pairs, 445 based on Foata normal form. 8/2553 useless extension candidates. Maximal degree in co-relation 11863. Up to 2039 conditions per place. [2024-06-04 18:12:30,261 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 77 selfloop transitions, 63 changer transitions 0/144 dead transitions. [2024-06-04 18:12:30,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1476 flow [2024-06-04 18:12:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:12:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:12:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 18:12:30,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-04 18:12:30,264 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 937 flow. Second operand 7 states and 133 transitions. [2024-06-04 18:12:30,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1476 flow [2024-06-04 18:12:30,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 144 transitions, 1450 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 18:12:30,281 INFO L231 Difference]: Finished difference. Result has 90 places, 115 transitions, 1137 flow [2024-06-04 18:12:30,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1137, PETRI_PLACES=90, PETRI_TRANSITIONS=115} [2024-06-04 18:12:30,282 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 18:12:30,282 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 115 transitions, 1137 flow [2024-06-04 18:12:30,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:30,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:30,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:30,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 18:12:30,283 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-04 18:12:30,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1859502465, now seen corresponding path program 2 times [2024-06-04 18:12:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282359561] [2024-06-04 18:12:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282359561] [2024-06-04 18:12:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282359561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:12:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676412842] [2024-06-04 18:12:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:36,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:12:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:12:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:12:36,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:36,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 115 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:36,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:36,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:36,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:37,856 INFO L124 PetriNetUnfolderBase]: 1649/2527 cut-off events. [2024-06-04 18:12:37,856 INFO L125 PetriNetUnfolderBase]: For 21955/21964 co-relation queries the response was YES. [2024-06-04 18:12:37,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 2527 events. 1649/2527 cut-off events. For 21955/21964 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12208 event pairs, 455 based on Foata normal form. 14/2537 useless extension candidates. Maximal degree in co-relation 12234. Up to 2023 conditions per place. [2024-06-04 18:12:37,871 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 77 selfloop transitions, 65 changer transitions 0/146 dead transitions. [2024-06-04 18:12:37,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 146 transitions, 1565 flow [2024-06-04 18:12:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:12:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:12:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 18:12:37,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-04 18:12:37,873 INFO L175 Difference]: Start difference. First operand has 90 places, 115 transitions, 1137 flow. Second operand 7 states and 135 transitions. [2024-06-04 18:12:37,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 146 transitions, 1565 flow [2024-06-04 18:12:37,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 146 transitions, 1474 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-04 18:12:37,895 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 1188 flow [2024-06-04 18:12:37,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1188, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2024-06-04 18:12:37,895 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-04 18:12:37,895 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1188 flow [2024-06-04 18:12:37,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:37,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:37,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:37,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 18:12:37,896 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-04 18:12:37,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1889651803, now seen corresponding path program 3 times [2024-06-04 18:12:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484838510] [2024-06-04 18:12:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484838510] [2024-06-04 18:12:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484838510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:45,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:12:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317799925] [2024-06-04 18:12:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:12:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:12:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:12:46,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:46,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1188 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:46,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:46,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:46,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:46,801 INFO L124 PetriNetUnfolderBase]: 1639/2507 cut-off events. [2024-06-04 18:12:46,802 INFO L125 PetriNetUnfolderBase]: For 24717/24728 co-relation queries the response was YES. [2024-06-04 18:12:46,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12430 conditions, 2507 events. 1639/2507 cut-off events. For 24717/24728 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12063 event pairs, 465 based on Foata normal form. 7/2499 useless extension candidates. Maximal degree in co-relation 12387. Up to 2015 conditions per place. [2024-06-04 18:12:46,815 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 73 selfloop transitions, 60 changer transitions 0/137 dead transitions. [2024-06-04 18:12:46,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 137 transitions, 1518 flow [2024-06-04 18:12:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:12:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:12:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 18:12:46,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 18:12:46,817 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 1188 flow. Second operand 7 states and 124 transitions. [2024-06-04 18:12:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 137 transitions, 1518 flow [2024-06-04 18:12:46,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 137 transitions, 1384 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 18:12:46,838 INFO L231 Difference]: Finished difference. Result has 96 places, 115 transitions, 1182 flow [2024-06-04 18:12:46,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1182, PETRI_PLACES=96, PETRI_TRANSITIONS=115} [2024-06-04 18:12:46,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-04 18:12:46,839 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 115 transitions, 1182 flow [2024-06-04 18:12:46,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:46,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:46,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:46,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 18:12:46,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:12:46,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -470418324, now seen corresponding path program 1 times [2024-06-04 18:12:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574248950] [2024-06-04 18:12:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574248950] [2024-06-04 18:12:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574248950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:12:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674321700] [2024-06-04 18:12:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:53,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:12:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:12:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:12:53,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:12:53,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 115 transitions, 1182 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:53,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:53,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:12:53,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:53,878 INFO L124 PetriNetUnfolderBase]: 1643/2518 cut-off events. [2024-06-04 18:12:53,879 INFO L125 PetriNetUnfolderBase]: For 26564/26582 co-relation queries the response was YES. [2024-06-04 18:12:53,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12619 conditions, 2518 events. 1643/2518 cut-off events. For 26564/26582 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12096 event pairs, 490 based on Foata normal form. 14/2525 useless extension candidates. Maximal degree in co-relation 12575. Up to 2402 conditions per place. [2024-06-04 18:12:53,893 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 112 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2024-06-04 18:12:53,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 135 transitions, 1574 flow [2024-06-04 18:12:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:12:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:12:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-04 18:12:53,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 18:12:53,895 INFO L175 Difference]: Start difference. First operand has 96 places, 115 transitions, 1182 flow. Second operand 6 states and 99 transitions. [2024-06-04 18:12:53,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 135 transitions, 1574 flow [2024-06-04 18:12:53,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 1402 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 18:12:53,915 INFO L231 Difference]: Finished difference. Result has 96 places, 123 transitions, 1136 flow [2024-06-04 18:12:53,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1136, PETRI_PLACES=96, PETRI_TRANSITIONS=123} [2024-06-04 18:12:53,916 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-04 18:12:53,916 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 123 transitions, 1136 flow [2024-06-04 18:12:53,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:53,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:53,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 18:12:53,916 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-04 18:12:53,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1068096776, now seen corresponding path program 1 times [2024-06-04 18:12:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727523819] [2024-06-04 18:12:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727523819] [2024-06-04 18:13:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727523819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680304573] [2024-06-04 18:13:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:02,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:02,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 123 transitions, 1136 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:02,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:02,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:02,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:03,367 INFO L124 PetriNetUnfolderBase]: 1660/2540 cut-off events. [2024-06-04 18:13:03,368 INFO L125 PetriNetUnfolderBase]: For 29050/29055 co-relation queries the response was YES. [2024-06-04 18:13:03,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12973 conditions, 2540 events. 1660/2540 cut-off events. For 29050/29055 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12300 event pairs, 367 based on Foata normal form. 6/2542 useless extension candidates. Maximal degree in co-relation 12927. Up to 2222 conditions per place. [2024-06-04 18:13:03,382 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 111 selfloop transitions, 35 changer transitions 0/150 dead transitions. [2024-06-04 18:13:03,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 150 transitions, 1578 flow [2024-06-04 18:13:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-04 18:13:03,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-04 18:13:03,384 INFO L175 Difference]: Start difference. First operand has 96 places, 123 transitions, 1136 flow. Second operand 7 states and 125 transitions. [2024-06-04 18:13:03,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 150 transitions, 1578 flow [2024-06-04 18:13:03,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 150 transitions, 1538 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-04 18:13:03,409 INFO L231 Difference]: Finished difference. Result has 101 places, 125 transitions, 1191 flow [2024-06-04 18:13:03,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1191, PETRI_PLACES=101, PETRI_TRANSITIONS=125} [2024-06-04 18:13:03,409 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-04 18:13:03,410 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 125 transitions, 1191 flow [2024-06-04 18:13:03,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:03,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:03,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:03,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 18:13:03,410 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-04 18:13:03,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1694707026, now seen corresponding path program 2 times [2024-06-04 18:13:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986221405] [2024-06-04 18:13:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:10,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986221405] [2024-06-04 18:13:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986221405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:10,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512320505] [2024-06-04 18:13:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:10,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:10,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 125 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:10,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:10,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:10,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:11,704 INFO L124 PetriNetUnfolderBase]: 1652/2527 cut-off events. [2024-06-04 18:13:11,704 INFO L125 PetriNetUnfolderBase]: For 31772/31777 co-relation queries the response was YES. [2024-06-04 18:13:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13187 conditions, 2527 events. 1652/2527 cut-off events. For 31772/31777 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12199 event pairs, 364 based on Foata normal form. 6/2529 useless extension candidates. Maximal degree in co-relation 13139. Up to 2216 conditions per place. [2024-06-04 18:13:11,718 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 41 changer transitions 0/158 dead transitions. [2024-06-04 18:13:11,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 158 transitions, 1599 flow [2024-06-04 18:13:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:13:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:13:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-04 18:13:11,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-04 18:13:11,720 INFO L175 Difference]: Start difference. First operand has 101 places, 125 transitions, 1191 flow. Second operand 9 states and 154 transitions. [2024-06-04 18:13:11,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 158 transitions, 1599 flow [2024-06-04 18:13:11,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 158 transitions, 1500 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:11,749 INFO L231 Difference]: Finished difference. Result has 105 places, 125 transitions, 1183 flow [2024-06-04 18:13:11,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=105, PETRI_TRANSITIONS=125} [2024-06-04 18:13:11,750 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-04 18:13:11,750 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 125 transitions, 1183 flow [2024-06-04 18:13:11,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:11,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:11,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:11,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 18:13:11,750 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-04 18:13:11,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1810182894, now seen corresponding path program 1 times [2024-06-04 18:13:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950308942] [2024-06-04 18:13:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950308942] [2024-06-04 18:13:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950308942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:13:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913442901] [2024-06-04 18:13:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:13:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:13:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:13:18,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:18,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 125 transitions, 1183 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-04 18:13:18,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:18,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:19,703 INFO L124 PetriNetUnfolderBase]: 1778/2731 cut-off events. [2024-06-04 18:13:19,703 INFO L125 PetriNetUnfolderBase]: For 39448/39453 co-relation queries the response was YES. [2024-06-04 18:13:19,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 2731 events. 1778/2731 cut-off events. For 39448/39453 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13515 event pairs, 144 based on Foata normal form. 34/2761 useless extension candidates. Maximal degree in co-relation 14015. Up to 1578 conditions per place. [2024-06-04 18:13:19,718 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 64 changer transitions 0/176 dead transitions. [2024-06-04 18:13:19,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1761 flow [2024-06-04 18:13:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:13:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:13:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-04 18:13:19,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-04 18:13:19,721 INFO L175 Difference]: Start difference. First operand has 105 places, 125 transitions, 1183 flow. Second operand 10 states and 179 transitions. [2024-06-04 18:13:19,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1761 flow [2024-06-04 18:13:19,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 176 transitions, 1623 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 18:13:19,750 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 1262 flow [2024-06-04 18:13:19,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1262, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2024-06-04 18:13:19,750 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-04 18:13:19,750 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 129 transitions, 1262 flow [2024-06-04 18:13:19,751 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-04 18:13:19,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:19,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:19,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 18:13:19,751 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:13:19,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -424146151, now seen corresponding path program 1 times [2024-06-04 18:13:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014639404] [2024-06-04 18:13:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014639404] [2024-06-04 18:13:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014639404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770993346] [2024-06-04 18:13:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:25,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:26,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:26,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 129 transitions, 1262 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:26,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:26,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:26,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:26,771 INFO L124 PetriNetUnfolderBase]: 1783/2743 cut-off events. [2024-06-04 18:13:26,771 INFO L125 PetriNetUnfolderBase]: For 42060/42066 co-relation queries the response was YES. [2024-06-04 18:13:26,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14752 conditions, 2743 events. 1783/2743 cut-off events. For 42060/42066 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13625 event pairs, 478 based on Foata normal form. 7/2747 useless extension candidates. Maximal degree in co-relation 14703. Up to 2647 conditions per place. [2024-06-04 18:13:26,784 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 131 selfloop transitions, 13 changer transitions 0/148 dead transitions. [2024-06-04 18:13:26,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1634 flow [2024-06-04 18:13:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 18:13:26,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 18:13:26,785 INFO L175 Difference]: Start difference. First operand has 107 places, 129 transitions, 1262 flow. Second operand 6 states and 100 transitions. [2024-06-04 18:13:26,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1634 flow [2024-06-04 18:13:26,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 148 transitions, 1520 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 18:13:26,828 INFO L231 Difference]: Finished difference. Result has 107 places, 132 transitions, 1217 flow [2024-06-04 18:13:26,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1217, PETRI_PLACES=107, PETRI_TRANSITIONS=132} [2024-06-04 18:13:26,828 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-04 18:13:26,828 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 1217 flow [2024-06-04 18:13:26,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:26,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:26,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:26,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 18:13:26,829 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-04 18:13:26,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash -122633692, now seen corresponding path program 2 times [2024-06-04 18:13:26,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062895134] [2024-06-04 18:13:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062895134] [2024-06-04 18:13:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062895134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:13:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865047635] [2024-06-04 18:13:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:13:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:13:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:13:34,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:34,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 1217 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-04 18:13:34,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:34,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:34,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:35,753 INFO L124 PetriNetUnfolderBase]: 1817/2789 cut-off events. [2024-06-04 18:13:35,753 INFO L125 PetriNetUnfolderBase]: For 46920/46928 co-relation queries the response was YES. [2024-06-04 18:13:35,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14782 conditions, 2789 events. 1817/2789 cut-off events. For 46920/46928 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13775 event pairs, 190 based on Foata normal form. 9/2784 useless extension candidates. Maximal degree in co-relation 14732. Up to 1593 conditions per place. [2024-06-04 18:13:35,769 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 110 selfloop transitions, 70 changer transitions 0/184 dead transitions. [2024-06-04 18:13:35,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 184 transitions, 1918 flow [2024-06-04 18:13:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:13:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:13:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-04 18:13:35,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-04 18:13:35,772 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 1217 flow. Second operand 10 states and 179 transitions. [2024-06-04 18:13:35,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 184 transitions, 1918 flow [2024-06-04 18:13:35,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 184 transitions, 1883 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 18:13:35,819 INFO L231 Difference]: Finished difference. Result has 114 places, 138 transitions, 1423 flow [2024-06-04 18:13:35,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1423, PETRI_PLACES=114, PETRI_TRANSITIONS=138} [2024-06-04 18:13:35,820 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-04 18:13:35,828 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 138 transitions, 1423 flow [2024-06-04 18:13:35,828 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-04 18:13:35,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:35,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:35,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 18:13:35,829 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-04 18:13:35,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash -645400012, now seen corresponding path program 3 times [2024-06-04 18:13:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055421971] [2024-06-04 18:13:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:42,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055421971] [2024-06-04 18:13:42,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055421971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:42,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:42,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:13:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551937880] [2024-06-04 18:13:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:42,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:13:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:13:42,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:13:42,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:42,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 138 transitions, 1423 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-04 18:13:42,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:42,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:42,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:43,871 INFO L124 PetriNetUnfolderBase]: 1809/2780 cut-off events. [2024-06-04 18:13:43,871 INFO L125 PetriNetUnfolderBase]: For 54467/54475 co-relation queries the response was YES. [2024-06-04 18:13:43,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15524 conditions, 2780 events. 1809/2780 cut-off events. For 54467/54475 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13774 event pairs, 182 based on Foata normal form. 5/2766 useless extension candidates. Maximal degree in co-relation 15472. Up to 1591 conditions per place. [2024-06-04 18:13:43,886 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 68 changer transitions 0/185 dead transitions. [2024-06-04 18:13:43,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 185 transitions, 1975 flow [2024-06-04 18:13:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:13:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:13:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-04 18:13:43,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41685144124168516 [2024-06-04 18:13:43,888 INFO L175 Difference]: Start difference. First operand has 114 places, 138 transitions, 1423 flow. Second operand 11 states and 188 transitions. [2024-06-04 18:13:43,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 185 transitions, 1975 flow [2024-06-04 18:13:43,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 185 transitions, 1835 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-04 18:13:43,940 INFO L231 Difference]: Finished difference. Result has 119 places, 138 transitions, 1429 flow [2024-06-04 18:13:43,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1429, PETRI_PLACES=119, PETRI_TRANSITIONS=138} [2024-06-04 18:13:43,941 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-04 18:13:43,941 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 138 transitions, 1429 flow [2024-06-04 18:13:43,941 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-04 18:13:43,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:43,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:43,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 18:13:43,942 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-04 18:13:43,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash -562148129, now seen corresponding path program 2 times [2024-06-04 18:13:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986148613] [2024-06-04 18:13:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986148613] [2024-06-04 18:13:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986148613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070869736] [2024-06-04 18:13:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:50,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:50,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:50,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 138 transitions, 1429 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:50,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:50,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:50,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:51,452 INFO L124 PetriNetUnfolderBase]: 1801/2777 cut-off events. [2024-06-04 18:13:51,452 INFO L125 PetriNetUnfolderBase]: For 52107/52125 co-relation queries the response was YES. [2024-06-04 18:13:51,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 2777 events. 1801/2777 cut-off events. For 52107/52125 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13767 event pairs, 475 based on Foata normal form. 14/2784 useless extension candidates. Maximal degree in co-relation 15279. Up to 2661 conditions per place. [2024-06-04 18:13:51,469 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 124 selfloop transitions, 21 changer transitions 0/149 dead transitions. [2024-06-04 18:13:51,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 149 transitions, 1757 flow [2024-06-04 18:13:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-04 18:13:51,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-04 18:13:51,471 INFO L175 Difference]: Start difference. First operand has 119 places, 138 transitions, 1429 flow. Second operand 6 states and 98 transitions. [2024-06-04 18:13:51,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 149 transitions, 1757 flow [2024-06-04 18:13:51,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 149 transitions, 1553 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 18:13:51,517 INFO L231 Difference]: Finished difference. Result has 114 places, 138 transitions, 1275 flow [2024-06-04 18:13:51,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1275, PETRI_PLACES=114, PETRI_TRANSITIONS=138} [2024-06-04 18:13:51,517 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-04 18:13:51,517 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 138 transitions, 1275 flow [2024-06-04 18:13:51,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:51,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:51,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:51,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 18:13:51,518 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:13:51,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1703786927, now seen corresponding path program 1 times [2024-06-04 18:13:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120618761] [2024-06-04 18:13:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:13:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120618761] [2024-06-04 18:13:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120618761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:57,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601911671] [2024-06-04 18:13:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:57,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:57,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:57,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:57,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:57,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:13:57,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 138 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:57,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:57,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:13:57,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:58,637 INFO L124 PetriNetUnfolderBase]: 1806/2778 cut-off events. [2024-06-04 18:13:58,637 INFO L125 PetriNetUnfolderBase]: For 53584/53586 co-relation queries the response was YES. [2024-06-04 18:13:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14936 conditions, 2778 events. 1806/2778 cut-off events. For 53584/53586 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13727 event pairs, 509 based on Foata normal form. 1/2776 useless extension candidates. Maximal degree in co-relation 14883. Up to 2698 conditions per place. [2024-06-04 18:13:58,652 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 138 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2024-06-04 18:13:58,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 1633 flow [2024-06-04 18:13:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-04 18:13:58,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-04 18:13:58,654 INFO L175 Difference]: Start difference. First operand has 114 places, 138 transitions, 1275 flow. Second operand 6 states and 97 transitions. [2024-06-04 18:13:58,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 1633 flow [2024-06-04 18:13:58,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 1574 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:58,714 INFO L231 Difference]: Finished difference. Result has 115 places, 141 transitions, 1274 flow [2024-06-04 18:13:58,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=115, PETRI_TRANSITIONS=141} [2024-06-04 18:13:58,715 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-04 18:13:58,715 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 141 transitions, 1274 flow [2024-06-04 18:13:58,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:58,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:58,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:58,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 18:13:58,716 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:13:58,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1698073007, now seen corresponding path program 2 times [2024-06-04 18:13:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632476772] [2024-06-04 18:13:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632476772] [2024-06-04 18:14:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632476772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:14:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327065432] [2024-06-04 18:14:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:04,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:14:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:14:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:14:05,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:05,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 141 transitions, 1274 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:05,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:05,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:05,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:05,759 INFO L124 PetriNetUnfolderBase]: 1803/2775 cut-off events. [2024-06-04 18:14:05,759 INFO L125 PetriNetUnfolderBase]: For 56952/56957 co-relation queries the response was YES. [2024-06-04 18:14:05,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15244 conditions, 2775 events. 1803/2775 cut-off events. For 56952/56957 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13715 event pairs, 513 based on Foata normal form. 3/2774 useless extension candidates. Maximal degree in co-relation 15190. Up to 2688 conditions per place. [2024-06-04 18:14:05,776 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 133 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2024-06-04 18:14:05,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 153 transitions, 1628 flow [2024-06-04 18:14:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:14:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:14:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-04 18:14:05,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:14:05,778 INFO L175 Difference]: Start difference. First operand has 115 places, 141 transitions, 1274 flow. Second operand 6 states and 96 transitions. [2024-06-04 18:14:05,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 153 transitions, 1628 flow [2024-06-04 18:14:05,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 153 transitions, 1592 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 18:14:05,825 INFO L231 Difference]: Finished difference. Result has 117 places, 144 transitions, 1312 flow [2024-06-04 18:14:05,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=117, PETRI_TRANSITIONS=144} [2024-06-04 18:14:05,826 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-04 18:14:05,826 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 144 transitions, 1312 flow [2024-06-04 18:14:05,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:05,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:05,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:05,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 18:14:05,827 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:14:05,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash -562134241, now seen corresponding path program 1 times [2024-06-04 18:14:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852800173] [2024-06-04 18:14:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852800173] [2024-06-04 18:14:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852800173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:13,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:13,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:14:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497207203] [2024-06-04 18:14:13,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:13,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:14:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:14:13,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:14:13,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:13,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 144 transitions, 1312 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:13,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:13,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:13,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:13,988 INFO L124 PetriNetUnfolderBase]: 1805/2783 cut-off events. [2024-06-04 18:14:13,988 INFO L125 PetriNetUnfolderBase]: For 60984/61002 co-relation queries the response was YES. [2024-06-04 18:14:13,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15623 conditions, 2783 events. 1805/2783 cut-off events. For 60984/61002 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13808 event pairs, 472 based on Foata normal form. 14/2790 useless extension candidates. Maximal degree in co-relation 15568. Up to 2661 conditions per place. [2024-06-04 18:14:14,007 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 130 selfloop transitions, 26 changer transitions 0/160 dead transitions. [2024-06-04 18:14:14,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 1708 flow [2024-06-04 18:14:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 18:14:14,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-04 18:14:14,008 INFO L175 Difference]: Start difference. First operand has 117 places, 144 transitions, 1312 flow. Second operand 7 states and 111 transitions. [2024-06-04 18:14:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 1708 flow [2024-06-04 18:14:14,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 1656 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 18:14:14,062 INFO L231 Difference]: Finished difference. Result has 120 places, 148 transitions, 1371 flow [2024-06-04 18:14:14,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1371, PETRI_PLACES=120, PETRI_TRANSITIONS=148} [2024-06-04 18:14:14,063 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-04 18:14:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 148 transitions, 1371 flow [2024-06-04 18:14:14,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:14,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:14,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 18:14:14,063 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:14:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 569620843, now seen corresponding path program 1 times [2024-06-04 18:14:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718050337] [2024-06-04 18:14:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718050337] [2024-06-04 18:14:20,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718050337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:20,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:14:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119430675] [2024-06-04 18:14:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:14:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:14:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:14:20,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:20,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 148 transitions, 1371 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:20,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:21,672 INFO L124 PetriNetUnfolderBase]: 1815/2800 cut-off events. [2024-06-04 18:14:21,672 INFO L125 PetriNetUnfolderBase]: For 65080/65089 co-relation queries the response was YES. [2024-06-04 18:14:21,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 2800 events. 1815/2800 cut-off events. For 65080/65089 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13947 event pairs, 464 based on Foata normal form. 10/2806 useless extension candidates. Maximal degree in co-relation 16131. Up to 2578 conditions per place. [2024-06-04 18:14:21,691 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 132 selfloop transitions, 38 changer transitions 0/174 dead transitions. [2024-06-04 18:14:21,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 174 transitions, 1819 flow [2024-06-04 18:14:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 18:14:21,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 18:14:21,692 INFO L175 Difference]: Start difference. First operand has 120 places, 148 transitions, 1371 flow. Second operand 7 states and 123 transitions. [2024-06-04 18:14:21,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 174 transitions, 1819 flow [2024-06-04 18:14:21,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 174 transitions, 1736 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 18:14:21,741 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1416 flow [2024-06-04 18:14:21,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1416, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-06-04 18:14:21,742 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2024-06-04 18:14:21,742 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1416 flow [2024-06-04 18:14:21,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:21,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:21,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 18:14:21,743 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-04 18:14:21,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -949175636, now seen corresponding path program 1 times [2024-06-04 18:14:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169580054] [2024-06-04 18:14:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169580054] [2024-06-04 18:14:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169580054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13013613] [2024-06-04 18:14:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:31,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:31,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:31,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1416 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:31,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:31,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:32,290 INFO L124 PetriNetUnfolderBase]: 1898/2947 cut-off events. [2024-06-04 18:14:32,290 INFO L125 PetriNetUnfolderBase]: For 75264/75273 co-relation queries the response was YES. [2024-06-04 18:14:32,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17346 conditions, 2947 events. 1898/2947 cut-off events. For 75264/75273 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14922 event pairs, 160 based on Foata normal form. 24/2967 useless extension candidates. Maximal degree in co-relation 17289. Up to 1622 conditions per place. [2024-06-04 18:14:32,306 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 129 selfloop transitions, 81 changer transitions 0/214 dead transitions. [2024-06-04 18:14:32,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 214 transitions, 2210 flow [2024-06-04 18:14:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:14:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:14:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-04 18:14:32,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44567627494456763 [2024-06-04 18:14:32,309 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1416 flow. Second operand 11 states and 201 transitions. [2024-06-04 18:14:32,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 214 transitions, 2210 flow [2024-06-04 18:14:32,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 214 transitions, 2048 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 18:14:32,380 INFO L231 Difference]: Finished difference. Result has 126 places, 155 transitions, 1485 flow [2024-06-04 18:14:32,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1485, PETRI_PLACES=126, PETRI_TRANSITIONS=155} [2024-06-04 18:14:32,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-04 18:14:32,381 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 155 transitions, 1485 flow [2024-06-04 18:14:32,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:32,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:32,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 18:14:32,382 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-04 18:14:32,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -949027766, now seen corresponding path program 2 times [2024-06-04 18:14:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365875341] [2024-06-04 18:14:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365875341] [2024-06-04 18:14:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365875341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460789480] [2024-06-04 18:14:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:41,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:41,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 155 transitions, 1485 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:41,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:41,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:42,875 INFO L124 PetriNetUnfolderBase]: 1973/3072 cut-off events. [2024-06-04 18:14:42,876 INFO L125 PetriNetUnfolderBase]: For 82788/82797 co-relation queries the response was YES. [2024-06-04 18:14:42,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18461 conditions, 3072 events. 1973/3072 cut-off events. For 82788/82797 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15789 event pairs, 170 based on Foata normal form. 28/3096 useless extension candidates. Maximal degree in co-relation 18403. Up to 1642 conditions per place. [2024-06-04 18:14:42,897 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 135 selfloop transitions, 77 changer transitions 0/216 dead transitions. [2024-06-04 18:14:42,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 216 transitions, 2204 flow [2024-06-04 18:14:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:14:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:14:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-04 18:14:42,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434589800443459 [2024-06-04 18:14:42,900 INFO L175 Difference]: Start difference. First operand has 126 places, 155 transitions, 1485 flow. Second operand 11 states and 200 transitions. [2024-06-04 18:14:42,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 216 transitions, 2204 flow [2024-06-04 18:14:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 216 transitions, 2074 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 18:14:42,982 INFO L231 Difference]: Finished difference. Result has 131 places, 158 transitions, 1574 flow [2024-06-04 18:14:42,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1574, PETRI_PLACES=131, PETRI_TRANSITIONS=158} [2024-06-04 18:14:42,983 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-04 18:14:42,983 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 158 transitions, 1574 flow [2024-06-04 18:14:42,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:42,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:42,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 18:14:42,984 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-04 18:14:42,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -943665386, now seen corresponding path program 3 times [2024-06-04 18:14:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429058113] [2024-06-04 18:14:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:14:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429058113] [2024-06-04 18:14:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429058113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:52,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363307894] [2024-06-04 18:14:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:52,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:52,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:14:52,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 158 transitions, 1574 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:52,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:52,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:14:52,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:53,598 INFO L124 PetriNetUnfolderBase]: 2065/3223 cut-off events. [2024-06-04 18:14:53,599 INFO L125 PetriNetUnfolderBase]: For 91095/91100 co-relation queries the response was YES. [2024-06-04 18:14:53,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19573 conditions, 3223 events. 2065/3223 cut-off events. For 91095/91100 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16848 event pairs, 212 based on Foata normal form. 26/3245 useless extension candidates. Maximal degree in co-relation 19513. Up to 1666 conditions per place. [2024-06-04 18:14:53,623 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 71 changer transitions 0/211 dead transitions. [2024-06-04 18:14:53,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 211 transitions, 2264 flow [2024-06-04 18:14:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:14:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:14:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-04 18:14:53,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-04 18:14:53,625 INFO L175 Difference]: Start difference. First operand has 131 places, 158 transitions, 1574 flow. Second operand 10 states and 183 transitions. [2024-06-04 18:14:53,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 211 transitions, 2264 flow [2024-06-04 18:14:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 211 transitions, 2132 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 18:14:53,749 INFO L231 Difference]: Finished difference. Result has 135 places, 161 transitions, 1657 flow [2024-06-04 18:14:53,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1657, PETRI_PLACES=135, PETRI_TRANSITIONS=161} [2024-06-04 18:14:53,750 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-04 18:14:53,750 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 161 transitions, 1657 flow [2024-06-04 18:14:53,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:14:53,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:53,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:53,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 18:14:53,750 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:14:53,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1455102535, now seen corresponding path program 2 times [2024-06-04 18:14:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904885056] [2024-06-04 18:14:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904885056] [2024-06-04 18:15:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904885056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265312047] [2024-06-04 18:15:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:00,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:00,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:00,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:00,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 161 transitions, 1657 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:00,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:00,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:00,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:01,403 INFO L124 PetriNetUnfolderBase]: 2093/3274 cut-off events. [2024-06-04 18:15:01,404 INFO L125 PetriNetUnfolderBase]: For 95829/95834 co-relation queries the response was YES. [2024-06-04 18:15:01,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20321 conditions, 3274 events. 2093/3274 cut-off events. For 95829/95834 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17315 event pairs, 545 based on Foata normal form. 4/3274 useless extension candidates. Maximal degree in co-relation 20259. Up to 2993 conditions per place. [2024-06-04 18:15:01,428 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 140 selfloop transitions, 41 changer transitions 0/185 dead transitions. [2024-06-04 18:15:01,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 185 transitions, 2219 flow [2024-06-04 18:15:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:15:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:15:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:15:01,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:15:01,430 INFO L175 Difference]: Start difference. First operand has 135 places, 161 transitions, 1657 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:15:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 185 transitions, 2219 flow [2024-06-04 18:15:01,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 185 transitions, 2082 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 18:15:01,560 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 1731 flow [2024-06-04 18:15:01,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1731, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2024-06-04 18:15:01,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-04 18:15:01,561 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 1731 flow [2024-06-04 18:15:01,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:01,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:01,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:01,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 18:15:01,561 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-04 18:15:01,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -815738598, now seen corresponding path program 4 times [2024-06-04 18:15:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:01,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404002166] [2024-06-04 18:15:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404002166] [2024-06-04 18:15:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404002166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:10,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:15:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283686969] [2024-06-04 18:15:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:15:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:15:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:15:10,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:10,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 1731 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:10,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:10,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:10,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:11,911 INFO L124 PetriNetUnfolderBase]: 2049/3206 cut-off events. [2024-06-04 18:15:11,911 INFO L125 PetriNetUnfolderBase]: For 95073/95084 co-relation queries the response was YES. [2024-06-04 18:15:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19568 conditions, 3206 events. 2049/3206 cut-off events. For 95073/95084 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16804 event pairs, 235 based on Foata normal form. 27/3218 useless extension candidates. Maximal degree in co-relation 19505. Up to 1693 conditions per place. [2024-06-04 18:15:11,933 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 138 selfloop transitions, 65 changer transitions 0/207 dead transitions. [2024-06-04 18:15:11,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 207 transitions, 2223 flow [2024-06-04 18:15:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-04 18:15:11,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 18:15:11,935 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 1731 flow. Second operand 9 states and 159 transitions. [2024-06-04 18:15:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 207 transitions, 2223 flow [2024-06-04 18:15:12,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 207 transitions, 2130 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-04 18:15:12,052 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 1736 flow [2024-06-04 18:15:12,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1736, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2024-06-04 18:15:12,052 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2024-06-04 18:15:12,052 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 168 transitions, 1736 flow [2024-06-04 18:15:12,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:12,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:12,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:12,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 18:15:12,053 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:12,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:12,053 INFO L85 PathProgramCache]: Analyzing trace with hash -246722133, now seen corresponding path program 3 times [2024-06-04 18:15:12,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:12,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261185872] [2024-06-04 18:15:12,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261185872] [2024-06-04 18:15:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261185872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:19,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:19,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912671806] [2024-06-04 18:15:19,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:19,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:19,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:19,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:19,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 168 transitions, 1736 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:19,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:19,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:19,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:20,071 INFO L124 PetriNetUnfolderBase]: 2081/3257 cut-off events. [2024-06-04 18:15:20,071 INFO L125 PetriNetUnfolderBase]: For 98191/98202 co-relation queries the response was YES. [2024-06-04 18:15:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20449 conditions, 3257 events. 2081/3257 cut-off events. For 98191/98202 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17212 event pairs, 540 based on Foata normal form. 7/3249 useless extension candidates. Maximal degree in co-relation 20383. Up to 2860 conditions per place. [2024-06-04 18:15:20,093 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 136 selfloop transitions, 56 changer transitions 0/196 dead transitions. [2024-06-04 18:15:20,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 196 transitions, 2482 flow [2024-06-04 18:15:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:15:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:15:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:15:20,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:15:20,094 INFO L175 Difference]: Start difference. First operand has 142 places, 168 transitions, 1736 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:15:20,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 196 transitions, 2482 flow [2024-06-04 18:15:20,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 196 transitions, 2261 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 18:15:20,198 INFO L231 Difference]: Finished difference. Result has 140 places, 182 transitions, 1859 flow [2024-06-04 18:15:20,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1859, PETRI_PLACES=140, PETRI_TRANSITIONS=182} [2024-06-04 18:15:20,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-04 18:15:20,198 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 182 transitions, 1859 flow [2024-06-04 18:15:20,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:20,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:20,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:20,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 18:15:20,199 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:20,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -494949551, now seen corresponding path program 1 times [2024-06-04 18:15:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:20,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581678970] [2024-06-04 18:15:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581678970] [2024-06-04 18:15:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581678970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:15:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330304846] [2024-06-04 18:15:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:27,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:15:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:15:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:15:27,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:27,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 182 transitions, 1859 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-04 18:15:27,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:27,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:27,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:28,061 INFO L124 PetriNetUnfolderBase]: 2091/3270 cut-off events. [2024-06-04 18:15:28,061 INFO L125 PetriNetUnfolderBase]: For 97247/97249 co-relation queries the response was YES. [2024-06-04 18:15:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20698 conditions, 3270 events. 2091/3270 cut-off events. For 97247/97249 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17221 event pairs, 519 based on Foata normal form. 2/3269 useless extension candidates. Maximal degree in co-relation 20630. Up to 3134 conditions per place. [2024-06-04 18:15:28,085 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 183 selfloop transitions, 19 changer transitions 0/206 dead transitions. [2024-06-04 18:15:28,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 206 transitions, 2386 flow [2024-06-04 18:15:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:15:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:15:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-04 18:15:28,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2024-06-04 18:15:28,089 INFO L175 Difference]: Start difference. First operand has 140 places, 182 transitions, 1859 flow. Second operand 8 states and 122 transitions. [2024-06-04 18:15:28,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 206 transitions, 2386 flow [2024-06-04 18:15:28,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 206 transitions, 2275 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-06-04 18:15:28,220 INFO L231 Difference]: Finished difference. Result has 148 places, 190 transitions, 1886 flow [2024-06-04 18:15:28,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1886, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2024-06-04 18:15:28,220 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-04 18:15:28,220 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1886 flow [2024-06-04 18:15:28,221 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-04 18:15:28,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:28,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-04 18:15:28,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:15:28,221 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:28,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1277786317, now seen corresponding path program 2 times [2024-06-04 18:15:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86152767] [2024-06-04 18:15:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:34,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-04 18:15:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86152767] [2024-06-04 18:15:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86152767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595319864] [2024-06-04 18:15:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:34,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:35,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:35,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1886 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:35,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:35,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:35,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:35,879 INFO L124 PetriNetUnfolderBase]: 2109/3287 cut-off events. [2024-06-04 18:15:35,880 INFO L125 PetriNetUnfolderBase]: For 101827/101829 co-relation queries the response was YES. [2024-06-04 18:15:35,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21076 conditions, 3287 events. 2109/3287 cut-off events. For 101827/101829 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17214 event pairs, 519 based on Foata normal form. 2/3286 useless extension candidates. Maximal degree in co-relation 21004. Up to 3146 conditions per place. [2024-06-04 18:15:35,905 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 182 selfloop transitions, 25 changer transitions 0/211 dead transitions. [2024-06-04 18:15:35,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 211 transitions, 2514 flow [2024-06-04 18:15:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:15:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:15:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 18:15:35,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 18:15:35,906 INFO L175 Difference]: Start difference. First operand has 148 places, 190 transitions, 1886 flow. Second operand 7 states and 114 transitions. [2024-06-04 18:15:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 211 transitions, 2514 flow [2024-06-04 18:15:36,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 211 transitions, 2454 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-04 18:15:36,025 INFO L231 Difference]: Finished difference. Result has 152 places, 196 transitions, 1988 flow [2024-06-04 18:15:36,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1988, PETRI_PLACES=152, PETRI_TRANSITIONS=196} [2024-06-04 18:15:36,025 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-04 18:15:36,025 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 196 transitions, 1988 flow [2024-06-04 18:15:36,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:36,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:36,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:36,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:15:36,026 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:36,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1586002909, now seen corresponding path program 1 times [2024-06-04 18:15:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143935583] [2024-06-04 18:15:36,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143935583] [2024-06-04 18:15:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143935583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719748843] [2024-06-04 18:15:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:42,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:43,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:43,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 196 transitions, 1988 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:43,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:43,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:43,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:44,028 INFO L124 PetriNetUnfolderBase]: 2160/3353 cut-off events. [2024-06-04 18:15:44,028 INFO L125 PetriNetUnfolderBase]: For 111740/111742 co-relation queries the response was YES. [2024-06-04 18:15:44,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22091 conditions, 3353 events. 2160/3353 cut-off events. For 111740/111742 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17494 event pairs, 499 based on Foata normal form. 3/3343 useless extension candidates. Maximal degree in co-relation 22018. Up to 3083 conditions per place. [2024-06-04 18:15:44,055 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 170 selfloop transitions, 49 changer transitions 0/223 dead transitions. [2024-06-04 18:15:44,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 223 transitions, 2714 flow [2024-06-04 18:15:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:15:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:15:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:15:44,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:15:44,056 INFO L175 Difference]: Start difference. First operand has 152 places, 196 transitions, 1988 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:15:44,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 223 transitions, 2714 flow [2024-06-04 18:15:44,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 223 transitions, 2640 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-04 18:15:44,196 INFO L231 Difference]: Finished difference. Result has 156 places, 209 transitions, 2239 flow [2024-06-04 18:15:44,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2239, PETRI_PLACES=156, PETRI_TRANSITIONS=209} [2024-06-04 18:15:44,196 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-04 18:15:44,196 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 209 transitions, 2239 flow [2024-06-04 18:15:44,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:44,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:44,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:44,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:15:44,197 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:44,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash -246300099, now seen corresponding path program 2 times [2024-06-04 18:15:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945910123] [2024-06-04 18:15:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:15:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945910123] [2024-06-04 18:15:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945910123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39250083] [2024-06-04 18:15:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:51,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:51,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:51,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:51,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:51,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 209 transitions, 2239 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:51,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:51,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:51,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:52,041 INFO L124 PetriNetUnfolderBase]: 2177/3383 cut-off events. [2024-06-04 18:15:52,042 INFO L125 PetriNetUnfolderBase]: For 117538/117546 co-relation queries the response was YES. [2024-06-04 18:15:52,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22693 conditions, 3383 events. 2177/3383 cut-off events. For 117538/117546 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17738 event pairs, 503 based on Foata normal form. 7/3375 useless extension candidates. Maximal degree in co-relation 22618. Up to 2953 conditions per place. [2024-06-04 18:15:52,077 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 149 selfloop transitions, 74 changer transitions 0/227 dead transitions. [2024-06-04 18:15:52,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 227 transitions, 2980 flow [2024-06-04 18:15:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:15:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:15:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:15:52,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:15:52,079 INFO L175 Difference]: Start difference. First operand has 156 places, 209 transitions, 2239 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:15:52,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 227 transitions, 2980 flow [2024-06-04 18:15:52,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 227 transitions, 2851 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-04 18:15:52,267 INFO L231 Difference]: Finished difference. Result has 160 places, 215 transitions, 2395 flow [2024-06-04 18:15:52,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2395, PETRI_PLACES=160, PETRI_TRANSITIONS=215} [2024-06-04 18:15:52,267 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-04 18:15:52,267 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 215 transitions, 2395 flow [2024-06-04 18:15:52,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:52,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:52,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:52,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:15:52,268 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:15:52,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -445430635, now seen corresponding path program 3 times [2024-06-04 18:15:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334287549] [2024-06-04 18:15:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:59,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-04 18:15:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334287549] [2024-06-04 18:15:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334287549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:15:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584710535] [2024-06-04 18:15:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:15:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:15:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:15:59,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:15:59,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 215 transitions, 2395 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:15:59,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:59,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:15:59,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:00,381 INFO L124 PetriNetUnfolderBase]: 2171/3375 cut-off events. [2024-06-04 18:16:00,382 INFO L125 PetriNetUnfolderBase]: For 124601/124609 co-relation queries the response was YES. [2024-06-04 18:16:00,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22968 conditions, 3375 events. 2171/3375 cut-off events. For 124601/124609 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17840 event pairs, 528 based on Foata normal form. 3/3374 useless extension candidates. Maximal degree in co-relation 22891. Up to 3221 conditions per place. [2024-06-04 18:16:00,407 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 32 changer transitions 0/230 dead transitions. [2024-06-04 18:16:00,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 230 transitions, 3011 flow [2024-06-04 18:16:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 18:16:00,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-04 18:16:00,410 INFO L175 Difference]: Start difference. First operand has 160 places, 215 transitions, 2395 flow. Second operand 7 states and 113 transitions. [2024-06-04 18:16:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 230 transitions, 3011 flow [2024-06-04 18:16:00,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 230 transitions, 2764 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-04 18:16:00,577 INFO L231 Difference]: Finished difference. Result has 161 places, 218 transitions, 2278 flow [2024-06-04 18:16:00,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2278, PETRI_PLACES=161, PETRI_TRANSITIONS=218} [2024-06-04 18:16:00,579 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-04 18:16:00,579 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 218 transitions, 2278 flow [2024-06-04 18:16:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:00,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:00,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:16:00,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 18:16:00,579 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:00,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -246537249, now seen corresponding path program 3 times [2024-06-04 18:16:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:00,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547010702] [2024-06-04 18:16:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547010702] [2024-06-04 18:16:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547010702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:07,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511822423] [2024-06-04 18:16:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:07,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:07,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:07,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:07,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:07,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 218 transitions, 2278 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:07,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:07,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:07,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:08,455 INFO L124 PetriNetUnfolderBase]: 2174/3380 cut-off events. [2024-06-04 18:16:08,455 INFO L125 PetriNetUnfolderBase]: For 128911/128919 co-relation queries the response was YES. [2024-06-04 18:16:08,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22837 conditions, 3380 events. 2174/3380 cut-off events. For 128911/128919 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17825 event pairs, 517 based on Foata normal form. 7/3372 useless extension candidates. Maximal degree in co-relation 22760. Up to 2952 conditions per place. [2024-06-04 18:16:08,479 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 155 selfloop transitions, 74 changer transitions 0/233 dead transitions. [2024-06-04 18:16:08,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 233 transitions, 2976 flow [2024-06-04 18:16:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:16:08,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:16:08,480 INFO L175 Difference]: Start difference. First operand has 161 places, 218 transitions, 2278 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:16:08,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 233 transitions, 2976 flow [2024-06-04 18:16:08,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 233 transitions, 2868 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 18:16:08,649 INFO L231 Difference]: Finished difference. Result has 163 places, 222 transitions, 2386 flow [2024-06-04 18:16:08,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2386, PETRI_PLACES=163, PETRI_TRANSITIONS=222} [2024-06-04 18:16:08,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-04 18:16:08,649 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 222 transitions, 2386 flow [2024-06-04 18:16:08,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:08,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:08,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:16:08,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 18:16:08,650 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:08,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -246291171, now seen corresponding path program 1 times [2024-06-04 18:16:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:08,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809125588] [2024-06-04 18:16:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809125588] [2024-06-04 18:16:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809125588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:16,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:16,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:16:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118914711] [2024-06-04 18:16:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:16,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:16:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:16:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:16:16,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:16,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 222 transitions, 2386 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-04 18:16:16,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:16,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:16,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:17,459 INFO L124 PetriNetUnfolderBase]: 2177/3388 cut-off events. [2024-06-04 18:16:17,459 INFO L125 PetriNetUnfolderBase]: For 133630/133642 co-relation queries the response was YES. [2024-06-04 18:16:17,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23225 conditions, 3388 events. 2177/3388 cut-off events. For 133630/133642 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17755 event pairs, 489 based on Foata normal form. 12/3394 useless extension candidates. Maximal degree in co-relation 23147. Up to 3229 conditions per place. [2024-06-04 18:16:17,487 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 205 selfloop transitions, 29 changer transitions 0/238 dead transitions. [2024-06-04 18:16:17,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 238 transitions, 2966 flow [2024-06-04 18:16:17,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:16:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:16:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-04 18:16:17,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 18:16:17,488 INFO L175 Difference]: Start difference. First operand has 163 places, 222 transitions, 2386 flow. Second operand 8 states and 123 transitions. [2024-06-04 18:16:17,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 238 transitions, 2966 flow [2024-06-04 18:16:17,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 238 transitions, 2783 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-04 18:16:17,721 INFO L231 Difference]: Finished difference. Result has 166 places, 225 transitions, 2345 flow [2024-06-04 18:16:17,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2345, PETRI_PLACES=166, PETRI_TRANSITIONS=225} [2024-06-04 18:16:17,722 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places. [2024-06-04 18:16:17,722 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 225 transitions, 2345 flow [2024-06-04 18:16:17,722 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-04 18:16:17,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:17,723 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-04 18:16:17,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 18:16:17,723 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:17,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1522384857, now seen corresponding path program 1 times [2024-06-04 18:16:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096821069] [2024-06-04 18:16:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:24,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:24,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096821069] [2024-06-04 18:16:24,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096821069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:24,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:24,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:24,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124521177] [2024-06-04 18:16:24,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:24,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:24,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:24,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 225 transitions, 2345 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:24,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:24,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:25,735 INFO L124 PetriNetUnfolderBase]: 2187/3409 cut-off events. [2024-06-04 18:16:25,735 INFO L125 PetriNetUnfolderBase]: For 138990/139008 co-relation queries the response was YES. [2024-06-04 18:16:25,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23294 conditions, 3409 events. 2187/3409 cut-off events. For 138990/139008 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17962 event pairs, 487 based on Foata normal form. 14/3410 useless extension candidates. Maximal degree in co-relation 23217. Up to 3152 conditions per place. [2024-06-04 18:16:25,761 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 201 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-04 18:16:25,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 245 transitions, 2942 flow [2024-06-04 18:16:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 18:16:25,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 18:16:25,762 INFO L175 Difference]: Start difference. First operand has 166 places, 225 transitions, 2345 flow. Second operand 7 states and 117 transitions. [2024-06-04 18:16:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 245 transitions, 2942 flow [2024-06-04 18:16:25,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 245 transitions, 2822 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-04 18:16:25,952 INFO L231 Difference]: Finished difference. Result has 167 places, 229 transitions, 2383 flow [2024-06-04 18:16:25,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2383, PETRI_PLACES=167, PETRI_TRANSITIONS=229} [2024-06-04 18:16:25,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-04 18:16:25,953 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 229 transitions, 2383 flow [2024-06-04 18:16:25,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:25,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:25,955 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-04 18:16:25,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 18:16:25,955 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:25,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash -903064272, now seen corresponding path program 1 times [2024-06-04 18:16:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165630882] [2024-06-04 18:16:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165630882] [2024-06-04 18:16:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165630882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79607292] [2024-06-04 18:16:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:32,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:32,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:32,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:32,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:32,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 229 transitions, 2383 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:32,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:32,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:32,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:33,420 INFO L124 PetriNetUnfolderBase]: 2187/3402 cut-off events. [2024-06-04 18:16:33,420 INFO L125 PetriNetUnfolderBase]: For 143074/143082 co-relation queries the response was YES. [2024-06-04 18:16:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23353 conditions, 3402 events. 2187/3402 cut-off events. For 143074/143082 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17869 event pairs, 480 based on Foata normal form. 6/3404 useless extension candidates. Maximal degree in co-relation 23275. Up to 3154 conditions per place. [2024-06-04 18:16:33,445 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 39 changer transitions 0/250 dead transitions. [2024-06-04 18:16:33,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 250 transitions, 2977 flow [2024-06-04 18:16:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 18:16:33,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:16:33,446 INFO L175 Difference]: Start difference. First operand has 167 places, 229 transitions, 2383 flow. Second operand 7 states and 119 transitions. [2024-06-04 18:16:33,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 250 transitions, 2977 flow [2024-06-04 18:16:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 250 transitions, 2868 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 18:16:33,665 INFO L231 Difference]: Finished difference. Result has 169 places, 232 transitions, 2413 flow [2024-06-04 18:16:33,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2413, PETRI_PLACES=169, PETRI_TRANSITIONS=232} [2024-06-04 18:16:33,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-04 18:16:33,665 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 232 transitions, 2413 flow [2024-06-04 18:16:33,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:33,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:33,666 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-04 18:16:33,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 18:16:33,666 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:33,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 417467832, now seen corresponding path program 2 times [2024-06-04 18:16:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948617778] [2024-06-04 18:16:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:40,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-04 18:16:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948617778] [2024-06-04 18:16:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948617778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:40,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525978051] [2024-06-04 18:16:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:40,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:40,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:40,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 232 transitions, 2413 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:40,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:40,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:40,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:41,464 INFO L124 PetriNetUnfolderBase]: 2181/3393 cut-off events. [2024-06-04 18:16:41,464 INFO L125 PetriNetUnfolderBase]: For 147373/147381 co-relation queries the response was YES. [2024-06-04 18:16:41,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23331 conditions, 3393 events. 2181/3393 cut-off events. For 147373/147381 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17835 event pairs, 481 based on Foata normal form. 6/3395 useless extension candidates. Maximal degree in co-relation 23252. Up to 3106 conditions per place. [2024-06-04 18:16:41,490 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 195 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2024-06-04 18:16:41,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 247 transitions, 3027 flow [2024-06-04 18:16:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 18:16:41,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-04 18:16:41,492 INFO L175 Difference]: Start difference. First operand has 169 places, 232 transitions, 2413 flow. Second operand 7 states and 118 transitions. [2024-06-04 18:16:41,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 247 transitions, 3027 flow [2024-06-04 18:16:41,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 247 transitions, 2932 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 18:16:41,662 INFO L231 Difference]: Finished difference. Result has 171 places, 232 transitions, 2423 flow [2024-06-04 18:16:41,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2423, PETRI_PLACES=171, PETRI_TRANSITIONS=232} [2024-06-04 18:16:41,663 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-04 18:16:41,663 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 232 transitions, 2423 flow [2024-06-04 18:16:41,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:41,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:41,663 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-04 18:16:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:16:41,664 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:41,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2136473885, now seen corresponding path program 2 times [2024-06-04 18:16:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778865907] [2024-06-04 18:16:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:48,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778865907] [2024-06-04 18:16:48,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778865907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:48,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063392675] [2024-06-04 18:16:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:48,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:48,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:48,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 232 transitions, 2423 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:48,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:48,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:48,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:49,586 INFO L124 PetriNetUnfolderBase]: 2193/3413 cut-off events. [2024-06-04 18:16:49,586 INFO L125 PetriNetUnfolderBase]: For 153906/153914 co-relation queries the response was YES. [2024-06-04 18:16:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23622 conditions, 3413 events. 2193/3413 cut-off events. For 153906/153914 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17941 event pairs, 503 based on Foata normal form. 6/3404 useless extension candidates. Maximal degree in co-relation 23542. Up to 2974 conditions per place. [2024-06-04 18:16:49,613 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 156 selfloop transitions, 87 changer transitions 0/247 dead transitions. [2024-06-04 18:16:49,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 247 transitions, 3184 flow [2024-06-04 18:16:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 18:16:49,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-04 18:16:49,618 INFO L175 Difference]: Start difference. First operand has 171 places, 232 transitions, 2423 flow. Second operand 7 states and 118 transitions. [2024-06-04 18:16:49,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 247 transitions, 3184 flow [2024-06-04 18:16:49,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 247 transitions, 3096 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 18:16:49,884 INFO L231 Difference]: Finished difference. Result has 174 places, 236 transitions, 2592 flow [2024-06-04 18:16:49,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2592, PETRI_PLACES=174, PETRI_TRANSITIONS=236} [2024-06-04 18:16:49,885 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2024-06-04 18:16:49,885 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 236 transitions, 2592 flow [2024-06-04 18:16:49,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:49,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:49,886 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-04 18:16:49,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 18:16:49,886 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:49,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 487632433, now seen corresponding path program 3 times [2024-06-04 18:16:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824246719] [2024-06-04 18:16:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:16:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:16:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:16:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824246719] [2024-06-04 18:16:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824246719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:16:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:16:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:16:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612683901] [2024-06-04 18:16:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:16:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:16:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:16:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:16:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:16:57,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:16:57,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 236 transitions, 2592 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:57,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:16:57,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:16:57,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:16:58,231 INFO L124 PetriNetUnfolderBase]: 2187/3405 cut-off events. [2024-06-04 18:16:58,231 INFO L125 PetriNetUnfolderBase]: For 158447/158455 co-relation queries the response was YES. [2024-06-04 18:16:58,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23811 conditions, 3405 events. 2187/3405 cut-off events. For 158447/158455 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17894 event pairs, 503 based on Foata normal form. 6/3396 useless extension candidates. Maximal degree in co-relation 23730. Up to 2969 conditions per place. [2024-06-04 18:16:58,262 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 160 selfloop transitions, 82 changer transitions 0/246 dead transitions. [2024-06-04 18:16:58,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 246 transitions, 3192 flow [2024-06-04 18:16:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:16:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:16:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 18:16:58,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-04 18:16:58,263 INFO L175 Difference]: Start difference. First operand has 174 places, 236 transitions, 2592 flow. Second operand 7 states and 116 transitions. [2024-06-04 18:16:58,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 246 transitions, 3192 flow [2024-06-04 18:16:58,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 246 transitions, 2998 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-04 18:16:58,577 INFO L231 Difference]: Finished difference. Result has 177 places, 236 transitions, 2570 flow [2024-06-04 18:16:58,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2570, PETRI_PLACES=177, PETRI_TRANSITIONS=236} [2024-06-04 18:16:58,577 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-04 18:16:58,577 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 236 transitions, 2570 flow [2024-06-04 18:16:58,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:16:58,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:16:58,578 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-04 18:16:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 18:16:58,578 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:16:58,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:16:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1635974830, now seen corresponding path program 3 times [2024-06-04 18:16:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:16:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526736959] [2024-06-04 18:16:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:16:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:16:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:05,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-04 18:17:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526736959] [2024-06-04 18:17:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526736959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:05,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:17:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034631637] [2024-06-04 18:17:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:05,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:17:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:17:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:17:05,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:05,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 236 transitions, 2570 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-04 18:17:05,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:05,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:06,963 INFO L124 PetriNetUnfolderBase]: 2182/3394 cut-off events. [2024-06-04 18:17:06,963 INFO L125 PetriNetUnfolderBase]: For 162047/162049 co-relation queries the response was YES. [2024-06-04 18:17:06,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23819 conditions, 3394 events. 2182/3394 cut-off events. For 162047/162049 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17730 event pairs, 509 based on Foata normal form. 3/3385 useless extension candidates. Maximal degree in co-relation 23737. Up to 3157 conditions per place. [2024-06-04 18:17:06,990 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 209 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2024-06-04 18:17:06,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 254 transitions, 3142 flow [2024-06-04 18:17:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:17:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:17:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 18:17:07,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-04 18:17:07,000 INFO L175 Difference]: Start difference. First operand has 177 places, 236 transitions, 2570 flow. Second operand 8 states and 127 transitions. [2024-06-04 18:17:07,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 254 transitions, 3142 flow [2024-06-04 18:17:07,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 254 transitions, 2817 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 18:17:07,269 INFO L231 Difference]: Finished difference. Result has 177 places, 237 transitions, 2347 flow [2024-06-04 18:17:07,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2347, PETRI_PLACES=177, PETRI_TRANSITIONS=237} [2024-06-04 18:17:07,270 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-04 18:17:07,270 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 237 transitions, 2347 flow [2024-06-04 18:17:07,270 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-04 18:17:07,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:07,270 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-04 18:17:07,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 18:17:07,270 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:07,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -956677200, now seen corresponding path program 4 times [2024-06-04 18:17:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474948673] [2024-06-04 18:17:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:17:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474948673] [2024-06-04 18:17:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474948673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:17:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348902558] [2024-06-04 18:17:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:14,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:17:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:14,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:17:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:17:14,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:14,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 237 transitions, 2347 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:14,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:14,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:14,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:15,493 INFO L124 PetriNetUnfolderBase]: 2174/3380 cut-off events. [2024-06-04 18:17:15,493 INFO L125 PetriNetUnfolderBase]: For 166638/166642 co-relation queries the response was YES. [2024-06-04 18:17:15,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 3380 events. 2174/3380 cut-off events. For 166638/166642 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17714 event pairs, 510 based on Foata normal form. 3/3370 useless extension candidates. Maximal degree in co-relation 23377. Up to 3110 conditions per place. [2024-06-04 18:17:15,522 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 195 selfloop transitions, 51 changer transitions 0/250 dead transitions. [2024-06-04 18:17:15,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 250 transitions, 2879 flow [2024-06-04 18:17:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:17:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:17:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 18:17:15,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 18:17:15,524 INFO L175 Difference]: Start difference. First operand has 177 places, 237 transitions, 2347 flow. Second operand 7 states and 117 transitions. [2024-06-04 18:17:15,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 250 transitions, 2879 flow [2024-06-04 18:17:15,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 250 transitions, 2746 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 18:17:15,765 INFO L231 Difference]: Finished difference. Result has 178 places, 237 transitions, 2324 flow [2024-06-04 18:17:15,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2324, PETRI_PLACES=178, PETRI_TRANSITIONS=237} [2024-06-04 18:17:15,765 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-04 18:17:15,766 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 237 transitions, 2324 flow [2024-06-04 18:17:15,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:15,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:15,766 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-04 18:17:15,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 18:17:15,766 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:15,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 233718704, now seen corresponding path program 5 times [2024-06-04 18:17:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3513465] [2024-06-04 18:17:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:17:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3513465] [2024-06-04 18:17:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3513465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:17:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031111354] [2024-06-04 18:17:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:22,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:17:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:17:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:17:22,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:22,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 237 transitions, 2324 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:22,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:22,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:22,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:23,833 INFO L124 PetriNetUnfolderBase]: 2176/3389 cut-off events. [2024-06-04 18:17:23,833 INFO L125 PetriNetUnfolderBase]: For 173653/173663 co-relation queries the response was YES. [2024-06-04 18:17:23,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23512 conditions, 3389 events. 2176/3389 cut-off events. For 173653/173663 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17836 event pairs, 532 based on Foata normal form. 9/3383 useless extension candidates. Maximal degree in co-relation 23427. Up to 2959 conditions per place. [2024-06-04 18:17:23,864 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 164 selfloop transitions, 83 changer transitions 0/251 dead transitions. [2024-06-04 18:17:23,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 251 transitions, 2990 flow [2024-06-04 18:17:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:17:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:17:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 18:17:23,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-04 18:17:23,865 INFO L175 Difference]: Start difference. First operand has 178 places, 237 transitions, 2324 flow. Second operand 7 states and 118 transitions. [2024-06-04 18:17:23,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 251 transitions, 2990 flow [2024-06-04 18:17:24,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 251 transitions, 2870 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:17:24,108 INFO L231 Difference]: Finished difference. Result has 179 places, 241 transitions, 2431 flow [2024-06-04 18:17:24,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2431, PETRI_PLACES=179, PETRI_TRANSITIONS=241} [2024-06-04 18:17:24,109 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places. [2024-06-04 18:17:24,109 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 241 transitions, 2431 flow [2024-06-04 18:17:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:24,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:24,109 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-04 18:17:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 18:17:24,109 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:24,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 239432624, now seen corresponding path program 6 times [2024-06-04 18:17:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861213248] [2024-06-04 18:17:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:17:31,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861213248] [2024-06-04 18:17:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861213248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:17:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099956445] [2024-06-04 18:17:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:31,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:17:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:17:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:17:31,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:31,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 241 transitions, 2431 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:31,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:31,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:31,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:32,067 INFO L124 PetriNetUnfolderBase]: 2160/3363 cut-off events. [2024-06-04 18:17:32,067 INFO L125 PetriNetUnfolderBase]: For 175682/175692 co-relation queries the response was YES. [2024-06-04 18:17:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23532 conditions, 3363 events. 2160/3363 cut-off events. For 175682/175692 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17635 event pairs, 532 based on Foata normal form. 7/3355 useless extension candidates. Maximal degree in co-relation 23446. Up to 2943 conditions per place. [2024-06-04 18:17:32,098 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 159 selfloop transitions, 87 changer transitions 0/250 dead transitions. [2024-06-04 18:17:32,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 250 transitions, 2947 flow [2024-06-04 18:17:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:17:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:17:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 18:17:32,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-04 18:17:32,100 INFO L175 Difference]: Start difference. First operand has 179 places, 241 transitions, 2431 flow. Second operand 7 states and 116 transitions. [2024-06-04 18:17:32,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 250 transitions, 2947 flow [2024-06-04 18:17:32,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 250 transitions, 2764 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-04 18:17:32,355 INFO L231 Difference]: Finished difference. Result has 182 places, 241 transitions, 2431 flow [2024-06-04 18:17:32,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2431, PETRI_PLACES=182, PETRI_TRANSITIONS=241} [2024-06-04 18:17:32,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-04 18:17:32,356 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 241 transitions, 2431 flow [2024-06-04 18:17:32,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:32,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:32,356 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-04 18:17:32,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 18:17:32,356 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:32,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash 246613650, now seen corresponding path program 1 times [2024-06-04 18:17:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:32,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115135028] [2024-06-04 18:17:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:17:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115135028] [2024-06-04 18:17:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115135028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:17:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14508885] [2024-06-04 18:17:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:40,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:17:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:17:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:17:40,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:40,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 241 transitions, 2431 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:40,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:40,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:40,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:41,227 INFO L124 PetriNetUnfolderBase]: 2165/3373 cut-off events. [2024-06-04 18:17:41,227 INFO L125 PetriNetUnfolderBase]: For 180859/180871 co-relation queries the response was YES. [2024-06-04 18:17:41,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23682 conditions, 3373 events. 2165/3373 cut-off events. For 180859/180871 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17719 event pairs, 517 based on Foata normal form. 9/3376 useless extension candidates. Maximal degree in co-relation 23595. Up to 3228 conditions per place. [2024-06-04 18:17:41,257 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 227 selfloop transitions, 24 changer transitions 0/255 dead transitions. [2024-06-04 18:17:41,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 255 transitions, 3025 flow [2024-06-04 18:17:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:17:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:17:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-04 18:17:41,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-04 18:17:41,258 INFO L175 Difference]: Start difference. First operand has 182 places, 241 transitions, 2431 flow. Second operand 7 states and 109 transitions. [2024-06-04 18:17:41,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 255 transitions, 3025 flow [2024-06-04 18:17:41,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 255 transitions, 2780 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 18:17:41,471 INFO L231 Difference]: Finished difference. Result has 181 places, 244 transitions, 2300 flow [2024-06-04 18:17:41,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2300, PETRI_PLACES=181, PETRI_TRANSITIONS=244} [2024-06-04 18:17:41,471 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-04 18:17:41,471 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 244 transitions, 2300 flow [2024-06-04 18:17:41,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:41,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:41,472 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-04 18:17:41,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 18:17:41,472 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:41,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 246626670, now seen corresponding path program 2 times [2024-06-04 18:17:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810773549] [2024-06-04 18:17:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:17:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:49,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810773549] [2024-06-04 18:17:49,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810773549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:49,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:17:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296077512] [2024-06-04 18:17:49,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:49,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:17:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:17:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:17:49,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:49,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 244 transitions, 2300 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:49,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:49,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:49,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:50,176 INFO L124 PetriNetUnfolderBase]: 2162/3369 cut-off events. [2024-06-04 18:17:50,176 INFO L125 PetriNetUnfolderBase]: For 185067/185079 co-relation queries the response was YES. [2024-06-04 18:17:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23643 conditions, 3369 events. 2162/3369 cut-off events. For 185067/185079 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17678 event pairs, 517 based on Foata normal form. 9/3372 useless extension candidates. Maximal degree in co-relation 23555. Up to 3215 conditions per place. [2024-06-04 18:17:50,203 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 224 selfloop transitions, 31 changer transitions 0/259 dead transitions. [2024-06-04 18:17:50,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 2910 flow [2024-06-04 18:17:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:17:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:17:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-04 18:17:50,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2024-06-04 18:17:50,205 INFO L175 Difference]: Start difference. First operand has 181 places, 244 transitions, 2300 flow. Second operand 8 states and 122 transitions. [2024-06-04 18:17:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 2910 flow [2024-06-04 18:17:50,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 259 transitions, 2818 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 18:17:50,480 INFO L231 Difference]: Finished difference. Result has 184 places, 247 transitions, 2346 flow [2024-06-04 18:17:50,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2346, PETRI_PLACES=184, PETRI_TRANSITIONS=247} [2024-06-04 18:17:50,480 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-04 18:17:50,480 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 247 transitions, 2346 flow [2024-06-04 18:17:50,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:17:50,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:50,481 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-04 18:17:50,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 18:17:50,481 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:50,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -960478544, now seen corresponding path program 1 times [2024-06-04 18:17:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310725574] [2024-06-04 18:17:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:17:57,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-04 18:17:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:17:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310725574] [2024-06-04 18:17:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310725574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:17:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:17:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:17:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314280055] [2024-06-04 18:17:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:17:57,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:17:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:17:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:17:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:17:58,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:17:58,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 247 transitions, 2346 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-04 18:17:58,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:17:58,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:17:58,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:17:59,014 INFO L124 PetriNetUnfolderBase]: 2159/3361 cut-off events. [2024-06-04 18:17:59,014 INFO L125 PetriNetUnfolderBase]: For 189777/189781 co-relation queries the response was YES. [2024-06-04 18:17:59,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23879 conditions, 3361 events. 2159/3361 cut-off events. For 189777/189781 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17665 event pairs, 540 based on Foata normal form. 2/3360 useless extension candidates. Maximal degree in co-relation 23790. Up to 3229 conditions per place. [2024-06-04 18:17:59,044 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 239 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2024-06-04 18:17:59,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 263 transitions, 2912 flow [2024-06-04 18:17:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:17:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:17:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 18:17:59,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-04 18:17:59,047 INFO L175 Difference]: Start difference. First operand has 184 places, 247 transitions, 2346 flow. Second operand 7 states and 113 transitions. [2024-06-04 18:17:59,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 263 transitions, 2912 flow [2024-06-04 18:17:59,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 263 transitions, 2778 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-04 18:17:59,311 INFO L231 Difference]: Finished difference. Result has 185 places, 247 transitions, 2262 flow [2024-06-04 18:17:59,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2262, PETRI_PLACES=185, PETRI_TRANSITIONS=247} [2024-06-04 18:17:59,312 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-04 18:17:59,312 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 247 transitions, 2262 flow [2024-06-04 18:17:59,312 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-04 18:17:59,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:17:59,312 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-04 18:17:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 18:17:59,312 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:17:59,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:17:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -960388179, now seen corresponding path program 1 times [2024-06-04 18:17:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:17:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623100252] [2024-06-04 18:17:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:17:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:17:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623100252] [2024-06-04 18:18:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623100252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:06,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719938687] [2024-06-04 18:18:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:06,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:06,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:06,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 247 transitions, 2262 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-04 18:18:06,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:06,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:06,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:07,352 INFO L124 PetriNetUnfolderBase]: 2245/3466 cut-off events. [2024-06-04 18:18:07,352 INFO L125 PetriNetUnfolderBase]: For 205398/205402 co-relation queries the response was YES. [2024-06-04 18:18:07,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24742 conditions, 3466 events. 2245/3466 cut-off events. For 205398/205402 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18073 event pairs, 448 based on Foata normal form. 7/3451 useless extension candidates. Maximal degree in co-relation 24652. Up to 2879 conditions per place. [2024-06-04 18:18:07,385 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 191 selfloop transitions, 97 changer transitions 0/292 dead transitions. [2024-06-04 18:18:07,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 292 transitions, 3317 flow [2024-06-04 18:18:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:18:07,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:18:07,387 INFO L175 Difference]: Start difference. First operand has 185 places, 247 transitions, 2262 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:18:07,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 292 transitions, 3317 flow [2024-06-04 18:18:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 292 transitions, 3265 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:18:07,681 INFO L231 Difference]: Finished difference. Result has 189 places, 271 transitions, 2773 flow [2024-06-04 18:18:07,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2773, PETRI_PLACES=189, PETRI_TRANSITIONS=271} [2024-06-04 18:18:07,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-04 18:18:07,682 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 271 transitions, 2773 flow [2024-06-04 18:18:07,682 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-04 18:18:07,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:07,682 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-04 18:18:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 18:18:07,682 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-04 18:18:07,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1921448838, now seen corresponding path program 1 times [2024-06-04 18:18:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363488342] [2024-06-04 18:18:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:15,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363488342] [2024-06-04 18:18:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363488342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47071898] [2024-06-04 18:18:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:15,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:15,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:15,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 271 transitions, 2773 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-04 18:18:15,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:15,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:16,333 INFO L124 PetriNetUnfolderBase]: 2398/3679 cut-off events. [2024-06-04 18:18:16,333 INFO L125 PetriNetUnfolderBase]: For 243215/243219 co-relation queries the response was YES. [2024-06-04 18:18:16,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28487 conditions, 3679 events. 2398/3679 cut-off events. For 243215/243219 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19228 event pairs, 447 based on Foata normal form. 10/3667 useless extension candidates. Maximal degree in co-relation 28394. Up to 2878 conditions per place. [2024-06-04 18:18:16,373 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 181 selfloop transitions, 122 changer transitions 0/307 dead transitions. [2024-06-04 18:18:16,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 307 transitions, 3955 flow [2024-06-04 18:18:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 18:18:16,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:18:16,374 INFO L175 Difference]: Start difference. First operand has 189 places, 271 transitions, 2773 flow. Second operand 8 states and 144 transitions. [2024-06-04 18:18:16,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 307 transitions, 3955 flow [2024-06-04 18:18:16,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 307 transitions, 3801 flow, removed 56 selfloop flow, removed 2 redundant places. [2024-06-04 18:18:16,852 INFO L231 Difference]: Finished difference. Result has 196 places, 287 transitions, 3240 flow [2024-06-04 18:18:16,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3240, PETRI_PLACES=196, PETRI_TRANSITIONS=287} [2024-06-04 18:18:16,852 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-04 18:18:16,852 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 287 transitions, 3240 flow [2024-06-04 18:18:16,853 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-04 18:18:16,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:16,853 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-04 18:18:16,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 18:18:16,854 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:18:16,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -956669109, now seen corresponding path program 2 times [2024-06-04 18:18:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981019203] [2024-06-04 18:18:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981019203] [2024-06-04 18:18:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981019203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:23,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452030766] [2024-06-04 18:18:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:23,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:23,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:23,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 287 transitions, 3240 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-04 18:18:23,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:23,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:23,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:25,228 INFO L124 PetriNetUnfolderBase]: 2556/3898 cut-off events. [2024-06-04 18:18:25,228 INFO L125 PetriNetUnfolderBase]: For 273152/273156 co-relation queries the response was YES. [2024-06-04 18:18:25,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32169 conditions, 3898 events. 2556/3898 cut-off events. For 273152/273156 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20421 event pairs, 486 based on Foata normal form. 7/3883 useless extension candidates. Maximal degree in co-relation 32073. Up to 2963 conditions per place. [2024-06-04 18:18:25,263 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 196 selfloop transitions, 131 changer transitions 0/331 dead transitions. [2024-06-04 18:18:25,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 331 transitions, 4675 flow [2024-06-04 18:18:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 18:18:25,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 18:18:25,264 INFO L175 Difference]: Start difference. First operand has 196 places, 287 transitions, 3240 flow. Second operand 8 states and 145 transitions. [2024-06-04 18:18:25,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 331 transitions, 4675 flow [2024-06-04 18:18:25,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 331 transitions, 4371 flow, removed 105 selfloop flow, removed 3 redundant places. [2024-06-04 18:18:25,685 INFO L231 Difference]: Finished difference. Result has 203 places, 309 transitions, 3745 flow [2024-06-04 18:18:25,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3745, PETRI_PLACES=203, PETRI_TRANSITIONS=309} [2024-06-04 18:18:25,685 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-04 18:18:25,685 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 309 transitions, 3745 flow [2024-06-04 18:18:25,686 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-04 18:18:25,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:25,686 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-04 18:18:25,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 18:18:25,686 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:18:25,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1921449055, now seen corresponding path program 3 times [2024-06-04 18:18:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916427927] [2024-06-04 18:18:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916427927] [2024-06-04 18:18:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916427927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:32,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685069620] [2024-06-04 18:18:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:32,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:32,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:32,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 309 transitions, 3745 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-04 18:18:32,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:32,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:32,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:33,937 INFO L124 PetriNetUnfolderBase]: 2534/3869 cut-off events. [2024-06-04 18:18:33,938 INFO L125 PetriNetUnfolderBase]: For 278421/278425 co-relation queries the response was YES. [2024-06-04 18:18:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31880 conditions, 3869 events. 2534/3869 cut-off events. For 278421/278425 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20213 event pairs, 468 based on Foata normal form. 13/3860 useless extension candidates. Maximal degree in co-relation 31780. Up to 2957 conditions per place. [2024-06-04 18:18:33,975 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 189 selfloop transitions, 141 changer transitions 0/334 dead transitions. [2024-06-04 18:18:33,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 334 transitions, 4817 flow [2024-06-04 18:18:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 18:18:33,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-04 18:18:33,976 INFO L175 Difference]: Start difference. First operand has 203 places, 309 transitions, 3745 flow. Second operand 8 states and 146 transitions. [2024-06-04 18:18:33,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 334 transitions, 4817 flow [2024-06-04 18:18:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 334 transitions, 4585 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-04 18:18:34,411 INFO L231 Difference]: Finished difference. Result has 208 places, 314 transitions, 3941 flow [2024-06-04 18:18:34,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3941, PETRI_PLACES=208, PETRI_TRANSITIONS=314} [2024-06-04 18:18:34,412 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-06-04 18:18:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 314 transitions, 3941 flow [2024-06-04 18:18:34,412 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-04 18:18:34,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:34,412 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-04 18:18:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 18:18:34,412 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:18:34,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 239440715, now seen corresponding path program 4 times [2024-06-04 18:18:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676608751] [2024-06-04 18:18:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676608751] [2024-06-04 18:18:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676608751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510977091] [2024-06-04 18:18:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:41,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:41,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:41,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 314 transitions, 3941 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-04 18:18:41,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:41,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:41,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:42,859 INFO L124 PetriNetUnfolderBase]: 2676/4085 cut-off events. [2024-06-04 18:18:42,859 INFO L125 PetriNetUnfolderBase]: For 302219/302229 co-relation queries the response was YES. [2024-06-04 18:18:42,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34561 conditions, 4085 events. 2676/4085 cut-off events. For 302219/302229 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21599 event pairs, 552 based on Foata normal form. 8/4075 useless extension candidates. Maximal degree in co-relation 34459. Up to 2542 conditions per place. [2024-06-04 18:18:42,903 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 204 selfloop transitions, 149 changer transitions 0/357 dead transitions. [2024-06-04 18:18:42,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 357 transitions, 5521 flow [2024-06-04 18:18:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 18:18:42,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-04 18:18:42,905 INFO L175 Difference]: Start difference. First operand has 208 places, 314 transitions, 3941 flow. Second operand 8 states and 146 transitions. [2024-06-04 18:18:42,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 357 transitions, 5521 flow [2024-06-04 18:18:43,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 357 transitions, 5223 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-04 18:18:43,542 INFO L231 Difference]: Finished difference. Result has 215 places, 334 transitions, 4489 flow [2024-06-04 18:18:43,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3643, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4489, PETRI_PLACES=215, PETRI_TRANSITIONS=334} [2024-06-04 18:18:43,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-04 18:18:43,543 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 334 transitions, 4489 flow [2024-06-04 18:18:43,543 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-04 18:18:43,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:43,543 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-04 18:18:43,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 18:18:43,543 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:18:43,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 239446295, now seen corresponding path program 5 times [2024-06-04 18:18:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890840079] [2024-06-04 18:18:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:18:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:18:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:18:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890840079] [2024-06-04 18:18:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890840079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:18:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:18:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:18:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115846885] [2024-06-04 18:18:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:18:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:18:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:18:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:18:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:18:50,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:18:50,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 334 transitions, 4489 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-04 18:18:50,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:18:50,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:18:50,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:18:52,111 INFO L124 PetriNetUnfolderBase]: 2820/4286 cut-off events. [2024-06-04 18:18:52,112 INFO L125 PetriNetUnfolderBase]: For 346791/346801 co-relation queries the response was YES. [2024-06-04 18:18:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38332 conditions, 4286 events. 2820/4286 cut-off events. For 346791/346801 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22710 event pairs, 570 based on Foata normal form. 14/4282 useless extension candidates. Maximal degree in co-relation 38226. Up to 2630 conditions per place. [2024-06-04 18:18:52,156 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 206 selfloop transitions, 158 changer transitions 0/368 dead transitions. [2024-06-04 18:18:52,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 368 transitions, 5981 flow [2024-06-04 18:18:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:18:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:18:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 18:18:52,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 18:18:52,157 INFO L175 Difference]: Start difference. First operand has 215 places, 334 transitions, 4489 flow. Second operand 8 states and 147 transitions. [2024-06-04 18:18:52,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 368 transitions, 5981 flow [2024-06-04 18:18:52,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 368 transitions, 5689 flow, removed 115 selfloop flow, removed 2 redundant places. [2024-06-04 18:18:52,837 INFO L231 Difference]: Finished difference. Result has 222 places, 346 transitions, 4834 flow [2024-06-04 18:18:52,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4251, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4834, PETRI_PLACES=222, PETRI_TRANSITIONS=346} [2024-06-04 18:18:52,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-04 18:18:52,838 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 346 transitions, 4834 flow [2024-06-04 18:18:52,838 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-04 18:18:52,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:18:52,838 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-04 18:18:52,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 18:18:52,838 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:18:52,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:18:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1777558308, now seen corresponding path program 2 times [2024-06-04 18:18:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:18:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049828832] [2024-06-04 18:18:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:18:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:18:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:00,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049828832] [2024-06-04 18:19:00,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049828832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:00,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:00,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946615727] [2024-06-04 18:19:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:00,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:00,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:00,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 346 transitions, 4834 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-04 18:19:00,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:00,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:00,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:01,433 INFO L124 PetriNetUnfolderBase]: 2789/4244 cut-off events. [2024-06-04 18:19:01,433 INFO L125 PetriNetUnfolderBase]: For 331574/331584 co-relation queries the response was YES. [2024-06-04 18:19:01,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37375 conditions, 4244 events. 2789/4244 cut-off events. For 331574/331584 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22499 event pairs, 556 based on Foata normal form. 11/4237 useless extension candidates. Maximal degree in co-relation 37266. Up to 3002 conditions per place. [2024-06-04 18:19:01,556 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 216 selfloop transitions, 155 changer transitions 0/375 dead transitions. [2024-06-04 18:19:01,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 375 transitions, 6126 flow [2024-06-04 18:19:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:19:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:19:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 18:19:01,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 18:19:01,557 INFO L175 Difference]: Start difference. First operand has 222 places, 346 transitions, 4834 flow. Second operand 8 states and 143 transitions. [2024-06-04 18:19:01,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 375 transitions, 6126 flow [2024-06-04 18:19:02,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 375 transitions, 5639 flow, removed 115 selfloop flow, removed 4 redundant places. [2024-06-04 18:19:02,297 INFO L231 Difference]: Finished difference. Result has 229 places, 356 transitions, 5039 flow [2024-06-04 18:19:02,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4427, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5039, PETRI_PLACES=229, PETRI_TRANSITIONS=356} [2024-06-04 18:19:02,297 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-04 18:19:02,298 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 356 transitions, 5039 flow [2024-06-04 18:19:02,298 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-04 18:19:02,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:02,298 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-04 18:19:02,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 18:19:02,298 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:02,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash 247065072, now seen corresponding path program 3 times [2024-06-04 18:19:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921212724] [2024-06-04 18:19:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921212724] [2024-06-04 18:19:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921212724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329806686] [2024-06-04 18:19:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:10,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:10,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:10,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 356 transitions, 5039 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-04 18:19:10,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:10,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:10,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:11,515 INFO L124 PetriNetUnfolderBase]: 2934/4449 cut-off events. [2024-06-04 18:19:11,515 INFO L125 PetriNetUnfolderBase]: For 360619/360629 co-relation queries the response was YES. [2024-06-04 18:19:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40041 conditions, 4449 events. 2934/4449 cut-off events. For 360619/360629 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23644 event pairs, 526 based on Foata normal form. 5/4436 useless extension candidates. Maximal degree in co-relation 39928. Up to 2974 conditions per place. [2024-06-04 18:19:11,569 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 204 selfloop transitions, 190 changer transitions 0/398 dead transitions. [2024-06-04 18:19:11,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 398 transitions, 6764 flow [2024-06-04 18:19:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:19:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:19:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 18:19:11,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 18:19:11,570 INFO L175 Difference]: Start difference. First operand has 229 places, 356 transitions, 5039 flow. Second operand 8 states and 143 transitions. [2024-06-04 18:19:11,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 398 transitions, 6764 flow [2024-06-04 18:19:12,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 398 transitions, 6571 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 18:19:12,241 INFO L231 Difference]: Finished difference. Result has 235 places, 379 transitions, 5865 flow [2024-06-04 18:19:12,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4852, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5865, PETRI_PLACES=235, PETRI_TRANSITIONS=379} [2024-06-04 18:19:12,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-04 18:19:12,242 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 379 transitions, 5865 flow [2024-06-04 18:19:12,242 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-04 18:19:12,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:12,242 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-04 18:19:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 18:19:12,242 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:12,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 246797945, now seen corresponding path program 6 times [2024-06-04 18:19:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544748817] [2024-06-04 18:19:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:19,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544748817] [2024-06-04 18:19:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544748817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502709065] [2024-06-04 18:19:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:19,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:19,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:19,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:19,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:19,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 379 transitions, 5865 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-04 18:19:19,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:19,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:19,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:20,907 INFO L124 PetriNetUnfolderBase]: 2958/4490 cut-off events. [2024-06-04 18:19:20,908 INFO L125 PetriNetUnfolderBase]: For 381316/381326 co-relation queries the response was YES. [2024-06-04 18:19:20,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 4490 events. 2958/4490 cut-off events. For 381316/381326 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23864 event pairs, 548 based on Foata normal form. 14/4486 useless extension candidates. Maximal degree in co-relation 41138. Up to 2737 conditions per place. [2024-06-04 18:19:20,960 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 202 selfloop transitions, 202 changer transitions 0/408 dead transitions. [2024-06-04 18:19:20,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 408 transitions, 7339 flow [2024-06-04 18:19:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:19:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:19:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 18:19:20,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 18:19:20,961 INFO L175 Difference]: Start difference. First operand has 235 places, 379 transitions, 5865 flow. Second operand 8 states and 147 transitions. [2024-06-04 18:19:20,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 408 transitions, 7339 flow [2024-06-04 18:19:21,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 408 transitions, 7145 flow, removed 66 selfloop flow, removed 2 redundant places. [2024-06-04 18:19:21,761 INFO L231 Difference]: Finished difference. Result has 242 places, 389 transitions, 6354 flow [2024-06-04 18:19:21,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5675, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6354, PETRI_PLACES=242, PETRI_TRANSITIONS=389} [2024-06-04 18:19:21,761 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places. [2024-06-04 18:19:21,761 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 389 transitions, 6354 flow [2024-06-04 18:19:21,761 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-04 18:19:21,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:21,761 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-04 18:19:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 18:19:21,762 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:21,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 954632608, now seen corresponding path program 4 times [2024-06-04 18:19:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43167110] [2024-06-04 18:19:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43167110] [2024-06-04 18:19:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43167110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279195710] [2024-06-04 18:19:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:29,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:29,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:29,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:29,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 389 transitions, 6354 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-04 18:19:29,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:29,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:29,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:31,016 INFO L124 PetriNetUnfolderBase]: 2941/4464 cut-off events. [2024-06-04 18:19:31,016 INFO L125 PetriNetUnfolderBase]: For 365676/365686 co-relation queries the response was YES. [2024-06-04 18:19:31,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41932 conditions, 4464 events. 2941/4464 cut-off events. For 365676/365686 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23609 event pairs, 532 based on Foata normal form. 8/4457 useless extension candidates. Maximal degree in co-relation 41813. Up to 4024 conditions per place. [2024-06-04 18:19:31,067 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 303 selfloop transitions, 96 changer transitions 0/403 dead transitions. [2024-06-04 18:19:31,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 403 transitions, 7290 flow [2024-06-04 18:19:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:19:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:19:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-04 18:19:31,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-04 18:19:31,069 INFO L175 Difference]: Start difference. First operand has 242 places, 389 transitions, 6354 flow. Second operand 8 states and 131 transitions. [2024-06-04 18:19:31,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 403 transitions, 7290 flow [2024-06-04 18:19:31,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 403 transitions, 6905 flow, removed 93 selfloop flow, removed 4 redundant places. [2024-06-04 18:19:31,858 INFO L231 Difference]: Finished difference. Result has 246 places, 393 transitions, 6289 flow [2024-06-04 18:19:31,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5983, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6289, PETRI_PLACES=246, PETRI_TRANSITIONS=393} [2024-06-04 18:19:31,858 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-04 18:19:31,859 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 393 transitions, 6289 flow [2024-06-04 18:19:31,859 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-04 18:19:31,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:31,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:19:31,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 18:19:31,859 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:31,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:31,859 INFO L85 PathProgramCache]: Analyzing trace with hash -574382386, now seen corresponding path program 1 times [2024-06-04 18:19:31,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:31,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803343642] [2024-06-04 18:19:31,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:31,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803343642] [2024-06-04 18:19:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803343642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995151031] [2024-06-04 18:19:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:38,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:38,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 393 transitions, 6289 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-04 18:19:38,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:38,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:38,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:40,245 INFO L124 PetriNetUnfolderBase]: 2957/4493 cut-off events. [2024-06-04 18:19:40,245 INFO L125 PetriNetUnfolderBase]: For 379011/379023 co-relation queries the response was YES. [2024-06-04 18:19:40,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41398 conditions, 4493 events. 2957/4493 cut-off events. For 379011/379023 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23791 event pairs, 395 based on Foata normal form. 14/4503 useless extension candidates. Maximal degree in co-relation 41279. Up to 4121 conditions per place. [2024-06-04 18:19:40,293 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 378 selfloop transitions, 46 changer transitions 0/428 dead transitions. [2024-06-04 18:19:40,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 428 transitions, 7307 flow [2024-06-04 18:19:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:19:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:19:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-04 18:19:40,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:19:40,295 INFO L175 Difference]: Start difference. First operand has 246 places, 393 transitions, 6289 flow. Second operand 9 states and 153 transitions. [2024-06-04 18:19:40,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 428 transitions, 7307 flow [2024-06-04 18:19:41,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 428 transitions, 7033 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-04 18:19:41,063 INFO L231 Difference]: Finished difference. Result has 249 places, 396 transitions, 6189 flow [2024-06-04 18:19:41,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6015, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6189, PETRI_PLACES=249, PETRI_TRANSITIONS=396} [2024-06-04 18:19:41,064 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places. [2024-06-04 18:19:41,064 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 396 transitions, 6189 flow [2024-06-04 18:19:41,064 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-04 18:19:41,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:41,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:19:41,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 18:19:41,064 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:41,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1795994178, now seen corresponding path program 2 times [2024-06-04 18:19:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291346943] [2024-06-04 18:19:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291346943] [2024-06-04 18:19:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291346943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:47,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:47,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239439730] [2024-06-04 18:19:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:47,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:47,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:47,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 396 transitions, 6189 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-04 18:19:47,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:47,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:47,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:49,151 INFO L124 PetriNetUnfolderBase]: 2973/4518 cut-off events. [2024-06-04 18:19:49,151 INFO L125 PetriNetUnfolderBase]: For 387365/387377 co-relation queries the response was YES. [2024-06-04 18:19:49,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41686 conditions, 4518 events. 2973/4518 cut-off events. For 387365/387377 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23973 event pairs, 396 based on Foata normal form. 14/4528 useless extension candidates. Maximal degree in co-relation 41566. Up to 4123 conditions per place. [2024-06-04 18:19:49,202 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 376 selfloop transitions, 53 changer transitions 0/433 dead transitions. [2024-06-04 18:19:49,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 433 transitions, 7227 flow [2024-06-04 18:19:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:19:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:19:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-04 18:19:49,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4073170731707317 [2024-06-04 18:19:49,204 INFO L175 Difference]: Start difference. First operand has 249 places, 396 transitions, 6189 flow. Second operand 10 states and 167 transitions. [2024-06-04 18:19:49,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 433 transitions, 7227 flow [2024-06-04 18:19:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 433 transitions, 7075 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-04 18:19:50,022 INFO L231 Difference]: Finished difference. Result has 252 places, 399 transitions, 6231 flow [2024-06-04 18:19:50,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6231, PETRI_PLACES=252, PETRI_TRANSITIONS=399} [2024-06-04 18:19:50,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-04 18:19:50,022 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 399 transitions, 6231 flow [2024-06-04 18:19:50,023 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-04 18:19:50,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:50,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:19:50,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 18:19:50,023 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:50,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1518948790, now seen corresponding path program 1 times [2024-06-04 18:19:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499831927] [2024-06-04 18:19:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:19:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:19:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:19:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499831927] [2024-06-04 18:19:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499831927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:19:57,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:19:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:19:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489825134] [2024-06-04 18:19:57,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:19:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:19:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:19:57,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:19:57,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:19:57,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:19:57,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 399 transitions, 6231 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:19:57,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:19:57,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:19:57,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:19:58,984 INFO L124 PetriNetUnfolderBase]: 2983/4536 cut-off events. [2024-06-04 18:19:58,985 INFO L125 PetriNetUnfolderBase]: For 395278/395296 co-relation queries the response was YES. [2024-06-04 18:19:59,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42029 conditions, 4536 events. 2983/4536 cut-off events. For 395278/395296 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24166 event pairs, 513 based on Foata normal form. 14/4537 useless extension candidates. Maximal degree in co-relation 41908. Up to 4261 conditions per place. [2024-06-04 18:19:59,040 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 371 selfloop transitions, 45 changer transitions 0/420 dead transitions. [2024-06-04 18:19:59,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 420 transitions, 7200 flow [2024-06-04 18:19:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:19:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:19:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 18:19:59,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-04 18:19:59,041 INFO L175 Difference]: Start difference. First operand has 252 places, 399 transitions, 6231 flow. Second operand 8 states and 130 transitions. [2024-06-04 18:19:59,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 420 transitions, 7200 flow [2024-06-04 18:19:59,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 420 transitions, 7028 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-04 18:19:59,907 INFO L231 Difference]: Finished difference. Result has 252 places, 403 transitions, 6245 flow [2024-06-04 18:19:59,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6059, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6245, PETRI_PLACES=252, PETRI_TRANSITIONS=403} [2024-06-04 18:19:59,908 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-04 18:19:59,908 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 403 transitions, 6245 flow [2024-06-04 18:19:59,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:19:59,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:19:59,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:19:59,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 18:19:59,909 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:19:59,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:19:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash 829862594, now seen corresponding path program 1 times [2024-06-04 18:19:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:19:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100890819] [2024-06-04 18:19:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:19:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:19:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:20:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100890819] [2024-06-04 18:20:06,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100890819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:06,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348619980] [2024-06-04 18:20:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:06,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:06,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 403 transitions, 6245 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-04 18:20:06,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:06,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:06,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:07,953 INFO L124 PetriNetUnfolderBase]: 2983/4517 cut-off events. [2024-06-04 18:20:07,953 INFO L125 PetriNetUnfolderBase]: For 405490/405500 co-relation queries the response was YES. [2024-06-04 18:20:07,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41886 conditions, 4517 events. 2983/4517 cut-off events. For 405490/405500 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23883 event pairs, 489 based on Foata normal form. 6/4519 useless extension candidates. Maximal degree in co-relation 41764. Up to 3975 conditions per place. [2024-06-04 18:20:07,999 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 343 selfloop transitions, 84 changer transitions 0/431 dead transitions. [2024-06-04 18:20:07,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 431 transitions, 7273 flow [2024-06-04 18:20:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:20:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:20:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:20:08,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:20:08,000 INFO L175 Difference]: Start difference. First operand has 252 places, 403 transitions, 6245 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:20:08,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 431 transitions, 7273 flow [2024-06-04 18:20:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 431 transitions, 7144 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 18:20:08,775 INFO L231 Difference]: Finished difference. Result has 255 places, 407 transitions, 6411 flow [2024-06-04 18:20:08,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6116, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6411, PETRI_PLACES=255, PETRI_TRANSITIONS=407} [2024-06-04 18:20:08,775 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 213 predicate places. [2024-06-04 18:20:08,776 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 407 transitions, 6411 flow [2024-06-04 18:20:08,776 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-04 18:20:08,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:08,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 18:20:08,776 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:20:08,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1628816820, now seen corresponding path program 2 times [2024-06-04 18:20:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976031587] [2024-06-04 18:20:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:20:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976031587] [2024-06-04 18:20:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976031587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723121712] [2024-06-04 18:20:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:15,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:15,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:15,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:15,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:15,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 407 transitions, 6411 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-04 18:20:15,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:15,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:15,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:16,823 INFO L124 PetriNetUnfolderBase]: 2989/4537 cut-off events. [2024-06-04 18:20:16,823 INFO L125 PetriNetUnfolderBase]: For 416966/416976 co-relation queries the response was YES. [2024-06-04 18:20:16,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42490 conditions, 4537 events. 2989/4537 cut-off events. For 416966/416976 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24118 event pairs, 483 based on Foata normal form. 6/4539 useless extension candidates. Maximal degree in co-relation 42366. Up to 3941 conditions per place. [2024-06-04 18:20:16,871 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 340 selfloop transitions, 92 changer transitions 0/436 dead transitions. [2024-06-04 18:20:16,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 436 transitions, 7659 flow [2024-06-04 18:20:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:20:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:20:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 18:20:16,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 18:20:16,872 INFO L175 Difference]: Start difference. First operand has 255 places, 407 transitions, 6411 flow. Second operand 8 states and 142 transitions. [2024-06-04 18:20:16,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 436 transitions, 7659 flow [2024-06-04 18:20:17,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 436 transitions, 7491 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-04 18:20:17,837 INFO L231 Difference]: Finished difference. Result has 260 places, 413 transitions, 6647 flow [2024-06-04 18:20:17,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6647, PETRI_PLACES=260, PETRI_TRANSITIONS=413} [2024-06-04 18:20:17,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places. [2024-06-04 18:20:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 413 transitions, 6647 flow [2024-06-04 18:20:17,838 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-04 18:20:17,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:17,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:17,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 18:20:17,839 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-04 18:20:17,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash 510442884, now seen corresponding path program 3 times [2024-06-04 18:20:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868740808] [2024-06-04 18:20:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:24,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-04 18:20:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868740808] [2024-06-04 18:20:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868740808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492977487] [2024-06-04 18:20:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:25,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:25,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 413 transitions, 6647 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-04 18:20:25,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:25,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:26,500 INFO L124 PetriNetUnfolderBase]: 3065/4646 cut-off events. [2024-06-04 18:20:26,500 INFO L125 PetriNetUnfolderBase]: For 448499/448509 co-relation queries the response was YES. [2024-06-04 18:20:26,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44415 conditions, 4646 events. 3065/4646 cut-off events. For 448499/448509 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 24703 event pairs, 508 based on Foata normal form. 6/4648 useless extension candidates. Maximal degree in co-relation 44289. Up to 3905 conditions per place. [2024-06-04 18:20:26,551 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 341 selfloop transitions, 103 changer transitions 0/448 dead transitions. [2024-06-04 18:20:26,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 448 transitions, 8178 flow [2024-06-04 18:20:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:20:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:20:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-04 18:20:26,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-04 18:20:26,553 INFO L175 Difference]: Start difference. First operand has 260 places, 413 transitions, 6647 flow. Second operand 8 states and 138 transitions. [2024-06-04 18:20:26,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 448 transitions, 8178 flow [2024-06-04 18:20:27,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 448 transitions, 7968 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-04 18:20:27,570 INFO L231 Difference]: Finished difference. Result has 264 places, 426 transitions, 7090 flow [2024-06-04 18:20:27,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6437, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7090, PETRI_PLACES=264, PETRI_TRANSITIONS=426} [2024-06-04 18:20:27,570 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-04 18:20:27,570 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 426 transitions, 7090 flow [2024-06-04 18:20:27,570 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-04 18:20:27,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:27,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:27,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 18:20:27,571 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-04 18:20:27,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash -455591058, now seen corresponding path program 3 times [2024-06-04 18:20:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:27,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73750401] [2024-06-04 18:20:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:20:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73750401] [2024-06-04 18:20:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73750401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:34,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:34,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895326852] [2024-06-04 18:20:34,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:34,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:34,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:34,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 426 transitions, 7090 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-04 18:20:34,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:34,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:36,179 INFO L124 PetriNetUnfolderBase]: 3094/4689 cut-off events. [2024-06-04 18:20:36,179 INFO L125 PetriNetUnfolderBase]: For 467363/467373 co-relation queries the response was YES. [2024-06-04 18:20:36,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45323 conditions, 4689 events. 3094/4689 cut-off events. For 467363/467373 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24950 event pairs, 410 based on Foata normal form. 9/4694 useless extension candidates. Maximal degree in co-relation 45195. Up to 4208 conditions per place. [2024-06-04 18:20:36,236 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 388 selfloop transitions, 62 changer transitions 0/454 dead transitions. [2024-06-04 18:20:36,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 454 transitions, 8320 flow [2024-06-04 18:20:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:20:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:20:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-04 18:20:36,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-04 18:20:36,238 INFO L175 Difference]: Start difference. First operand has 264 places, 426 transitions, 7090 flow. Second operand 9 states and 148 transitions. [2024-06-04 18:20:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 454 transitions, 8320 flow [2024-06-04 18:20:37,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 454 transitions, 8116 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 18:20:37,242 INFO L231 Difference]: Finished difference. Result has 268 places, 431 transitions, 7154 flow [2024-06-04 18:20:37,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6886, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7154, PETRI_PLACES=268, PETRI_TRANSITIONS=431} [2024-06-04 18:20:37,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-04 18:20:37,243 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 431 transitions, 7154 flow [2024-06-04 18:20:37,243 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-04 18:20:37,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:37,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:37,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 18:20:37,243 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-04 18:20:37,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 56847602, now seen corresponding path program 2 times [2024-06-04 18:20:37,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:37,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421429674] [2024-06-04 18:20:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:20:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421429674] [2024-06-04 18:20:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421429674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240908131] [2024-06-04 18:20:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:45,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:45,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 431 transitions, 7154 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:20:45,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:45,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:46,570 INFO L124 PetriNetUnfolderBase]: 3104/4705 cut-off events. [2024-06-04 18:20:46,571 INFO L125 PetriNetUnfolderBase]: For 474963/474973 co-relation queries the response was YES. [2024-06-04 18:20:46,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45591 conditions, 4705 events. 3104/4705 cut-off events. For 474963/474973 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25117 event pairs, 534 based on Foata normal form. 7/4697 useless extension candidates. Maximal degree in co-relation 45462. Up to 4188 conditions per place. [2024-06-04 18:20:46,627 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 333 selfloop transitions, 119 changer transitions 0/456 dead transitions. [2024-06-04 18:20:46,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 456 transitions, 8440 flow [2024-06-04 18:20:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:20:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:20:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-04 18:20:46,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 18:20:46,629 INFO L175 Difference]: Start difference. First operand has 268 places, 431 transitions, 7154 flow. Second operand 8 states and 132 transitions. [2024-06-04 18:20:46,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 456 transitions, 8440 flow [2024-06-04 18:20:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 456 transitions, 8274 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-04 18:20:47,803 INFO L231 Difference]: Finished difference. Result has 271 places, 445 transitions, 7512 flow [2024-06-04 18:20:47,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6988, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7512, PETRI_PLACES=271, PETRI_TRANSITIONS=445} [2024-06-04 18:20:47,803 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places. [2024-06-04 18:20:47,804 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 445 transitions, 7512 flow [2024-06-04 18:20:47,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:20:47,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:47,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 18:20:47,804 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-04 18:20:47,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2062916716, now seen corresponding path program 3 times [2024-06-04 18:20:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214059686] [2024-06-04 18:20:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:20:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:20:55,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:20:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214059686] [2024-06-04 18:20:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214059686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:20:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:20:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:20:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017297873] [2024-06-04 18:20:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:20:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:20:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:20:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:20:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:20:55,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:20:55,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 445 transitions, 7512 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:20:55,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:20:55,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:20:55,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:20:56,804 INFO L124 PetriNetUnfolderBase]: 3114/4721 cut-off events. [2024-06-04 18:20:56,804 INFO L125 PetriNetUnfolderBase]: For 487342/487352 co-relation queries the response was YES. [2024-06-04 18:20:56,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46119 conditions, 4721 events. 3114/4721 cut-off events. For 487342/487352 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25187 event pairs, 537 based on Foata normal form. 7/4713 useless extension candidates. Maximal degree in co-relation 45988. Up to 4273 conditions per place. [2024-06-04 18:20:56,857 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 360 selfloop transitions, 95 changer transitions 0/459 dead transitions. [2024-06-04 18:20:56,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 459 transitions, 8548 flow [2024-06-04 18:20:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:20:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:20:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-04 18:20:56,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-04 18:20:56,858 INFO L175 Difference]: Start difference. First operand has 271 places, 445 transitions, 7512 flow. Second operand 8 states and 129 transitions. [2024-06-04 18:20:56,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 459 transitions, 8548 flow [2024-06-04 18:20:58,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 459 transitions, 8380 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-04 18:20:58,038 INFO L231 Difference]: Finished difference. Result has 275 places, 449 transitions, 7649 flow [2024-06-04 18:20:58,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7344, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7649, PETRI_PLACES=275, PETRI_TRANSITIONS=449} [2024-06-04 18:20:58,039 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2024-06-04 18:20:58,039 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 449 transitions, 7649 flow [2024-06-04 18:20:58,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:20:58,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:20:58,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:20:58,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 18:20:58,040 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-04 18:20:58,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:20:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2062171868, now seen corresponding path program 4 times [2024-06-04 18:20:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:20:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828116150] [2024-06-04 18:20:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:20:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:20:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828116150] [2024-06-04 18:21:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828116150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:05,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:21:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220516968] [2024-06-04 18:21:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:21:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:21:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:21:05,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:05,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 449 transitions, 7649 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:21:05,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:05,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:05,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:07,265 INFO L124 PetriNetUnfolderBase]: 3102/4702 cut-off events. [2024-06-04 18:21:07,265 INFO L125 PetriNetUnfolderBase]: For 495260/495270 co-relation queries the response was YES. [2024-06-04 18:21:07,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46230 conditions, 4702 events. 3102/4702 cut-off events. For 495260/495270 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 25074 event pairs, 534 based on Foata normal form. 7/4694 useless extension candidates. Maximal degree in co-relation 46097. Up to 4256 conditions per place. [2024-06-04 18:21:07,323 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 365 selfloop transitions, 90 changer transitions 0/459 dead transitions. [2024-06-04 18:21:07,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 459 transitions, 8585 flow [2024-06-04 18:21:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:21:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:21:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 18:21:07,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:21:07,325 INFO L175 Difference]: Start difference. First operand has 275 places, 449 transitions, 7649 flow. Second operand 8 states and 128 transitions. [2024-06-04 18:21:07,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 459 transitions, 8585 flow [2024-06-04 18:21:08,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 459 transitions, 8342 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 18:21:08,648 INFO L231 Difference]: Finished difference. Result has 277 places, 449 transitions, 7593 flow [2024-06-04 18:21:08,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7406, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7593, PETRI_PLACES=277, PETRI_TRANSITIONS=449} [2024-06-04 18:21:08,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-04 18:21:08,649 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 449 transitions, 7593 flow [2024-06-04 18:21:08,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:21:08,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:08,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:08,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 18:21:08,649 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:21:08,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1083443376, now seen corresponding path program 4 times [2024-06-04 18:21:08,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:08,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311645283] [2024-06-04 18:21:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311645283] [2024-06-04 18:21:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311645283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:21:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892565245] [2024-06-04 18:21:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:15,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:21:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:21:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:21:15,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:15,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 449 transitions, 7593 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-04 18:21:15,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:15,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:17,132 INFO L124 PetriNetUnfolderBase]: 3112/4703 cut-off events. [2024-06-04 18:21:17,132 INFO L125 PetriNetUnfolderBase]: For 505302/505306 co-relation queries the response was YES. [2024-06-04 18:21:17,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46523 conditions, 4703 events. 3112/4703 cut-off events. For 505302/505306 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24948 event pairs, 525 based on Foata normal form. 6/4688 useless extension candidates. Maximal degree in co-relation 46389. Up to 4170 conditions per place. [2024-06-04 18:21:17,184 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 379 selfloop transitions, 93 changer transitions 0/476 dead transitions. [2024-06-04 18:21:17,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 476 transitions, 8720 flow [2024-06-04 18:21:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:21:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:21:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-04 18:21:17,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-04 18:21:17,185 INFO L175 Difference]: Start difference. First operand has 277 places, 449 transitions, 7593 flow. Second operand 9 states and 148 transitions. [2024-06-04 18:21:17,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 476 transitions, 8720 flow [2024-06-04 18:21:18,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 476 transitions, 8487 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 18:21:18,218 INFO L231 Difference]: Finished difference. Result has 280 places, 453 transitions, 7664 flow [2024-06-04 18:21:18,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7360, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7664, PETRI_PLACES=280, PETRI_TRANSITIONS=453} [2024-06-04 18:21:18,218 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-06-04 18:21:18,218 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 453 transitions, 7664 flow [2024-06-04 18:21:18,219 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-04 18:21:18,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:18,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 18:21:18,219 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:21:18,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash 292724720, now seen corresponding path program 5 times [2024-06-04 18:21:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:18,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660804977] [2024-06-04 18:21:18,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:24,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660804977] [2024-06-04 18:21:24,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660804977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:24,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:24,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:21:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36942009] [2024-06-04 18:21:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:24,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:21:24,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:21:24,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:21:24,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:24,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 453 transitions, 7664 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-04 18:21:24,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:24,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:26,200 INFO L124 PetriNetUnfolderBase]: 3100/4684 cut-off events. [2024-06-04 18:21:26,200 INFO L125 PetriNetUnfolderBase]: For 513715/513719 co-relation queries the response was YES. [2024-06-04 18:21:26,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46326 conditions, 4684 events. 3100/4684 cut-off events. For 513715/513719 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24939 event pairs, 510 based on Foata normal form. 5/4665 useless extension candidates. Maximal degree in co-relation 46191. Up to 4062 conditions per place. [2024-06-04 18:21:26,256 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 366 selfloop transitions, 105 changer transitions 0/475 dead transitions. [2024-06-04 18:21:26,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 475 transitions, 8852 flow [2024-06-04 18:21:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:21:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:21:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 18:21:26,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 18:21:26,258 INFO L175 Difference]: Start difference. First operand has 280 places, 453 transitions, 7664 flow. Second operand 8 states and 140 transitions. [2024-06-04 18:21:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 475 transitions, 8852 flow [2024-06-04 18:21:27,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 475 transitions, 8624 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 18:21:27,587 INFO L231 Difference]: Finished difference. Result has 282 places, 454 transitions, 7688 flow [2024-06-04 18:21:27,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7436, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7688, PETRI_PLACES=282, PETRI_TRANSITIONS=454} [2024-06-04 18:21:27,588 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places. [2024-06-04 18:21:27,588 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 454 transitions, 7688 flow [2024-06-04 18:21:27,588 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-04 18:21:27,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:27,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:27,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 18:21:27,589 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:21:27,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 209815496, now seen corresponding path program 6 times [2024-06-04 18:21:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749104120] [2024-06-04 18:21:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749104120] [2024-06-04 18:21:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749104120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:21:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873210552] [2024-06-04 18:21:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:33,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:21:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:21:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:21:33,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:33,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 454 transitions, 7688 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-04 18:21:33,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:33,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:33,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:35,218 INFO L124 PetriNetUnfolderBase]: 3090/4670 cut-off events. [2024-06-04 18:21:35,218 INFO L125 PetriNetUnfolderBase]: For 515236/515240 co-relation queries the response was YES. [2024-06-04 18:21:35,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46210 conditions, 4670 events. 3090/4670 cut-off events. For 515236/515240 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24811 event pairs, 516 based on Foata normal form. 3/4649 useless extension candidates. Maximal degree in co-relation 46074. Up to 4138 conditions per place. [2024-06-04 18:21:35,269 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 387 selfloop transitions, 86 changer transitions 0/477 dead transitions. [2024-06-04 18:21:35,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 477 transitions, 8710 flow [2024-06-04 18:21:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:21:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:21:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-04 18:21:35,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-04 18:21:35,270 INFO L175 Difference]: Start difference. First operand has 282 places, 454 transitions, 7688 flow. Second operand 8 states and 138 transitions. [2024-06-04 18:21:35,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 477 transitions, 8710 flow [2024-06-04 18:21:36,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 477 transitions, 8440 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-04 18:21:36,605 INFO L231 Difference]: Finished difference. Result has 285 places, 454 transitions, 7597 flow [2024-06-04 18:21:36,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7418, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7597, PETRI_PLACES=285, PETRI_TRANSITIONS=454} [2024-06-04 18:21:36,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-04 18:21:36,605 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 454 transitions, 7597 flow [2024-06-04 18:21:36,605 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-04 18:21:36,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:36,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 18:21:36,606 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-04 18:21:36,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1571085436, now seen corresponding path program 7 times [2024-06-04 18:21:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:36,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066445798] [2024-06-04 18:21:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:42,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066445798] [2024-06-04 18:21:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066445798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:21:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689289142] [2024-06-04 18:21:42,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:42,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:21:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:21:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:21:42,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:42,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 454 transitions, 7597 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-04 18:21:42,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:42,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:42,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:44,384 INFO L124 PetriNetUnfolderBase]: 3084/4662 cut-off events. [2024-06-04 18:21:44,384 INFO L125 PetriNetUnfolderBase]: For 522694/522698 co-relation queries the response was YES. [2024-06-04 18:21:44,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45848 conditions, 4662 events. 3084/4662 cut-off events. For 522694/522698 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 24847 event pairs, 517 based on Foata normal form. 3/4641 useless extension candidates. Maximal degree in co-relation 45711. Up to 4105 conditions per place. [2024-06-04 18:21:44,439 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 379 selfloop transitions, 95 changer transitions 0/478 dead transitions. [2024-06-04 18:21:44,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 478 transitions, 8831 flow [2024-06-04 18:21:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:21:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:21:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-04 18:21:44,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-04 18:21:44,441 INFO L175 Difference]: Start difference. First operand has 285 places, 454 transitions, 7597 flow. Second operand 8 states and 138 transitions. [2024-06-04 18:21:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 478 transitions, 8831 flow [2024-06-04 18:21:45,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 478 transitions, 8585 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 18:21:45,650 INFO L231 Difference]: Finished difference. Result has 285 places, 456 transitions, 7635 flow [2024-06-04 18:21:45,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7351, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7635, PETRI_PLACES=285, PETRI_TRANSITIONS=456} [2024-06-04 18:21:45,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-04 18:21:45,650 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 456 transitions, 7635 flow [2024-06-04 18:21:45,650 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-04 18:21:45,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:45,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:45,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 18:21:45,650 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-04 18:21:45,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 564435656, now seen corresponding path program 8 times [2024-06-04 18:21:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991092329] [2024-06-04 18:21:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:21:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:21:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:21:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991092329] [2024-06-04 18:21:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991092329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:21:52,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:21:52,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:21:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537234046] [2024-06-04 18:21:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:21:52,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:21:52,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:21:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:21:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:21:52,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:21:52,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 456 transitions, 7635 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-04 18:21:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:21:52,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:21:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:21:53,816 INFO L124 PetriNetUnfolderBase]: 3114/4696 cut-off events. [2024-06-04 18:21:53,817 INFO L125 PetriNetUnfolderBase]: For 548249/548253 co-relation queries the response was YES. [2024-06-04 18:21:53,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46389 conditions, 4696 events. 3114/4696 cut-off events. For 548249/548253 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24855 event pairs, 510 based on Foata normal form. 7/4683 useless extension candidates. Maximal degree in co-relation 46252. Up to 3732 conditions per place. [2024-06-04 18:21:53,870 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 320 selfloop transitions, 159 changer transitions 0/483 dead transitions. [2024-06-04 18:21:53,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 483 transitions, 9134 flow [2024-06-04 18:21:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:21:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:21:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 18:21:53,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 18:21:53,871 INFO L175 Difference]: Start difference. First operand has 285 places, 456 transitions, 7635 flow. Second operand 8 states and 145 transitions. [2024-06-04 18:21:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 483 transitions, 9134 flow [2024-06-04 18:21:54,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 483 transitions, 8914 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-04 18:21:54,921 INFO L231 Difference]: Finished difference. Result has 288 places, 463 transitions, 7923 flow [2024-06-04 18:21:54,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7415, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7923, PETRI_PLACES=288, PETRI_TRANSITIONS=463} [2024-06-04 18:21:54,921 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 246 predicate places. [2024-06-04 18:21:54,921 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 463 transitions, 7923 flow [2024-06-04 18:21:54,921 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-04 18:21:54,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:21:54,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:21:54,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 18:21:54,922 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:21:54,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:21:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1583049886, now seen corresponding path program 9 times [2024-06-04 18:21:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:21:54,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156063818] [2024-06-04 18:21:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:21:54,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:21:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156063818] [2024-06-04 18:22:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156063818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181841494] [2024-06-04 18:22:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:01,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:01,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 463 transitions, 7923 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-04 18:22:01,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:01,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:01,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:02,967 INFO L124 PetriNetUnfolderBase]: 3094/4676 cut-off events. [2024-06-04 18:22:02,967 INFO L125 PetriNetUnfolderBase]: For 544736/544740 co-relation queries the response was YES. [2024-06-04 18:22:03,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46150 conditions, 4676 events. 3094/4676 cut-off events. For 544736/544740 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 24855 event pairs, 498 based on Foata normal form. 7/4659 useless extension candidates. Maximal degree in co-relation 46012. Up to 3721 conditions per place. [2024-06-04 18:22:03,023 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 316 selfloop transitions, 163 changer transitions 0/483 dead transitions. [2024-06-04 18:22:03,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 483 transitions, 9251 flow [2024-06-04 18:22:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:22:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:22:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 18:22:03,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:22:03,024 INFO L175 Difference]: Start difference. First operand has 288 places, 463 transitions, 7923 flow. Second operand 8 states and 144 transitions. [2024-06-04 18:22:03,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 483 transitions, 9251 flow [2024-06-04 18:22:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 483 transitions, 8822 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-04 18:22:04,396 INFO L231 Difference]: Finished difference. Result has 291 places, 463 transitions, 7831 flow [2024-06-04 18:22:04,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7494, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7831, PETRI_PLACES=291, PETRI_TRANSITIONS=463} [2024-06-04 18:22:04,396 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places. [2024-06-04 18:22:04,396 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 463 transitions, 7831 flow [2024-06-04 18:22:04,397 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-04 18:22:04,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:04,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 18:22:04,397 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:04,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 729837640, now seen corresponding path program 10 times [2024-06-04 18:22:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130858127] [2024-06-04 18:22:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130858127] [2024-06-04 18:22:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130858127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:11,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066789636] [2024-06-04 18:22:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:11,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:11,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 463 transitions, 7831 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-04 18:22:11,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:11,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:11,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:12,951 INFO L124 PetriNetUnfolderBase]: 3200/4845 cut-off events. [2024-06-04 18:22:12,951 INFO L125 PetriNetUnfolderBase]: For 588303/588313 co-relation queries the response was YES. [2024-06-04 18:22:12,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48110 conditions, 4845 events. 3200/4845 cut-off events. For 588303/588313 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25935 event pairs, 589 based on Foata normal form. 8/4835 useless extension candidates. Maximal degree in co-relation 47971. Up to 2893 conditions per place. [2024-06-04 18:22:13,010 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 253 selfloop transitions, 243 changer transitions 0/500 dead transitions. [2024-06-04 18:22:13,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 500 transitions, 9764 flow [2024-06-04 18:22:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:22:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:22:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 18:22:13,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 18:22:13,011 INFO L175 Difference]: Start difference. First operand has 291 places, 463 transitions, 7831 flow. Second operand 8 states and 145 transitions. [2024-06-04 18:22:13,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 500 transitions, 9764 flow [2024-06-04 18:22:14,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 500 transitions, 9234 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-04 18:22:14,311 INFO L231 Difference]: Finished difference. Result has 290 places, 480 transitions, 8216 flow [2024-06-04 18:22:14,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7301, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8216, PETRI_PLACES=290, PETRI_TRANSITIONS=480} [2024-06-04 18:22:14,312 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places. [2024-06-04 18:22:14,312 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 480 transitions, 8216 flow [2024-06-04 18:22:14,312 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-04 18:22:14,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:14,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:14,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 18:22:14,312 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:14,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash -699253884, now seen corresponding path program 11 times [2024-06-04 18:22:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752097525] [2024-06-04 18:22:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752097525] [2024-06-04 18:22:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752097525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317128095] [2024-06-04 18:22:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:21,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:21,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:21,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:21,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:21,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 480 transitions, 8216 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-04 18:22:21,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:21,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:21,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:22,660 INFO L124 PetriNetUnfolderBase]: 3182/4813 cut-off events. [2024-06-04 18:22:22,660 INFO L125 PetriNetUnfolderBase]: For 585230/585240 co-relation queries the response was YES. [2024-06-04 18:22:22,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47848 conditions, 4813 events. 3182/4813 cut-off events. For 585230/585240 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25718 event pairs, 560 based on Foata normal form. 8/4803 useless extension candidates. Maximal degree in co-relation 47709. Up to 2888 conditions per place. [2024-06-04 18:22:22,723 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 249 selfloop transitions, 247 changer transitions 0/500 dead transitions. [2024-06-04 18:22:22,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 500 transitions, 9773 flow [2024-06-04 18:22:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:22:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:22:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 18:22:22,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-04 18:22:22,724 INFO L175 Difference]: Start difference. First operand has 290 places, 480 transitions, 8216 flow. Second operand 8 states and 146 transitions. [2024-06-04 18:22:22,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 500 transitions, 9773 flow [2024-06-04 18:22:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 500 transitions, 9328 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-04 18:22:24,099 INFO L231 Difference]: Finished difference. Result has 294 places, 481 transitions, 8295 flow [2024-06-04 18:22:24,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7771, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8295, PETRI_PLACES=294, PETRI_TRANSITIONS=481} [2024-06-04 18:22:24,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-04 18:22:24,100 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 481 transitions, 8295 flow [2024-06-04 18:22:24,100 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-04 18:22:24,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:24,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:24,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 18:22:24,101 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:24,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1173951470, now seen corresponding path program 12 times [2024-06-04 18:22:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:24,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786272927] [2024-06-04 18:22:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786272927] [2024-06-04 18:22:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786272927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:31,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784356342] [2024-06-04 18:22:31,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:31,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:31,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:31,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 481 transitions, 8295 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-04 18:22:31,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:31,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:32,704 INFO L124 PetriNetUnfolderBase]: 3138/4753 cut-off events. [2024-06-04 18:22:32,704 INFO L125 PetriNetUnfolderBase]: For 578829/578839 co-relation queries the response was YES. [2024-06-04 18:22:32,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46548 conditions, 4753 events. 3138/4753 cut-off events. For 578829/578839 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25388 event pairs, 555 based on Foata normal form. 14/4749 useless extension candidates. Maximal degree in co-relation 46408. Up to 2868 conditions per place. [2024-06-04 18:22:32,762 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 261 selfloop transitions, 235 changer transitions 0/500 dead transitions. [2024-06-04 18:22:32,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 500 transitions, 9843 flow [2024-06-04 18:22:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:22:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:22:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 18:22:32,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 18:22:32,763 INFO L175 Difference]: Start difference. First operand has 294 places, 481 transitions, 8295 flow. Second operand 8 states and 147 transitions. [2024-06-04 18:22:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 500 transitions, 9843 flow [2024-06-04 18:22:34,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 500 transitions, 9264 flow, removed 77 selfloop flow, removed 5 redundant places. [2024-06-04 18:22:34,165 INFO L231 Difference]: Finished difference. Result has 297 places, 481 transitions, 8199 flow [2024-06-04 18:22:34,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7716, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8199, PETRI_PLACES=297, PETRI_TRANSITIONS=481} [2024-06-04 18:22:34,165 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-04 18:22:34,165 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 481 transitions, 8199 flow [2024-06-04 18:22:34,165 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-04 18:22:34,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:34,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:34,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 18:22:34,166 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:34,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1344777032, now seen corresponding path program 4 times [2024-06-04 18:22:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42466253] [2024-06-04 18:22:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42466253] [2024-06-04 18:22:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42466253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134852609] [2024-06-04 18:22:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:41,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:41,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 481 transitions, 8199 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-04 18:22:41,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:41,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:41,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:43,036 INFO L124 PetriNetUnfolderBase]: 3170/4800 cut-off events. [2024-06-04 18:22:43,036 INFO L125 PetriNetUnfolderBase]: For 575356/575366 co-relation queries the response was YES. [2024-06-04 18:22:43,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46694 conditions, 4800 events. 3170/4800 cut-off events. For 575356/575366 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 25566 event pairs, 414 based on Foata normal form. 13/4798 useless extension candidates. Maximal degree in co-relation 46553. Up to 4053 conditions per place. [2024-06-04 18:22:43,096 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 414 selfloop transitions, 93 changer transitions 0/511 dead transitions. [2024-06-04 18:22:43,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 511 transitions, 9825 flow [2024-06-04 18:22:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:22:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:22:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 18:22:43,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-04 18:22:43,098 INFO L175 Difference]: Start difference. First operand has 297 places, 481 transitions, 8199 flow. Second operand 9 states and 151 transitions. [2024-06-04 18:22:43,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 511 transitions, 9825 flow [2024-06-04 18:22:44,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 511 transitions, 8862 flow, removed 22 selfloop flow, removed 12 redundant places. [2024-06-04 18:22:44,396 INFO L231 Difference]: Finished difference. Result has 294 places, 490 transitions, 7641 flow [2024-06-04 18:22:44,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7236, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7641, PETRI_PLACES=294, PETRI_TRANSITIONS=490} [2024-06-04 18:22:44,396 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-04 18:22:44,396 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 490 transitions, 7641 flow [2024-06-04 18:22:44,396 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-04 18:22:44,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:44,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:44,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 18:22:44,397 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:44,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -931100756, now seen corresponding path program 1 times [2024-06-04 18:22:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252002149] [2024-06-04 18:22:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:22:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:22:51,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:22:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252002149] [2024-06-04 18:22:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252002149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:22:51,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:22:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:22:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002741202] [2024-06-04 18:22:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:22:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:22:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:22:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:22:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:22:52,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:22:52,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 490 transitions, 7641 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:22:52,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:22:52,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:22:52,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:22:53,454 INFO L124 PetriNetUnfolderBase]: 3186/4825 cut-off events. [2024-06-04 18:22:53,454 INFO L125 PetriNetUnfolderBase]: For 569169/569181 co-relation queries the response was YES. [2024-06-04 18:22:53,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45960 conditions, 4825 events. 3186/4825 cut-off events. For 569169/569181 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25774 event pairs, 500 based on Foata normal form. 12/4831 useless extension candidates. Maximal degree in co-relation 45821. Up to 4622 conditions per place. [2024-06-04 18:22:53,508 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 473 selfloop transitions, 35 changer transitions 0/512 dead transitions. [2024-06-04 18:22:53,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 512 transitions, 9061 flow [2024-06-04 18:22:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:22:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:22:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 18:22:53,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-04 18:22:53,510 INFO L175 Difference]: Start difference. First operand has 294 places, 490 transitions, 7641 flow. Second operand 8 states and 125 transitions. [2024-06-04 18:22:53,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 512 transitions, 9061 flow [2024-06-04 18:22:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 512 transitions, 8900 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-04 18:22:54,908 INFO L231 Difference]: Finished difference. Result has 299 places, 496 transitions, 7760 flow [2024-06-04 18:22:54,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7480, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7760, PETRI_PLACES=299, PETRI_TRANSITIONS=496} [2024-06-04 18:22:54,909 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-04 18:22:54,909 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 496 transitions, 7760 flow [2024-06-04 18:22:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:22:54,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:22:54,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:22:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 18:22:54,909 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:22:54,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:22:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -944922850, now seen corresponding path program 5 times [2024-06-04 18:22:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:22:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686437997] [2024-06-04 18:22:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:22:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:22:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23: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-04 18:23:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686437997] [2024-06-04 18:23:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686437997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:23:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630143924] [2024-06-04 18:23:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:23:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:23:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:23:02,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:02,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 496 transitions, 7760 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:02,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:02,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:02,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:03,541 INFO L124 PetriNetUnfolderBase]: 3210/4867 cut-off events. [2024-06-04 18:23:03,541 INFO L125 PetriNetUnfolderBase]: For 593636/593646 co-relation queries the response was YES. [2024-06-04 18:23:03,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46241 conditions, 4867 events. 3210/4867 cut-off events. For 593636/593646 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26195 event pairs, 551 based on Foata normal form. 6/4855 useless extension candidates. Maximal degree in co-relation 46099. Up to 3520 conditions per place. [2024-06-04 18:23:03,596 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 322 selfloop transitions, 193 changer transitions 0/519 dead transitions. [2024-06-04 18:23:03,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 519 transitions, 9458 flow [2024-06-04 18:23:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:23:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:23:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 18:23:03,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 18:23:03,597 INFO L175 Difference]: Start difference. First operand has 299 places, 496 transitions, 7760 flow. Second operand 8 states and 143 transitions. [2024-06-04 18:23:03,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 519 transitions, 9458 flow [2024-06-04 18:23:05,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 519 transitions, 9304 flow, removed 64 selfloop flow, removed 4 redundant places. [2024-06-04 18:23:05,015 INFO L231 Difference]: Finished difference. Result has 303 places, 501 transitions, 8123 flow [2024-06-04 18:23:05,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7606, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8123, PETRI_PLACES=303, PETRI_TRANSITIONS=501} [2024-06-04 18:23:05,016 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-04 18:23:05,016 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 501 transitions, 8123 flow [2024-06-04 18:23:05,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:05,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:05,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:05,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 18:23:05,017 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:05,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -476878980, now seen corresponding path program 2 times [2024-06-04 18:23:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939639410] [2024-06-04 18:23:05,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:23:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939639410] [2024-06-04 18:23:12,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939639410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:12,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:12,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:23:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207539016] [2024-06-04 18:23:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:12,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:23:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:23:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:23:12,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:12,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 501 transitions, 8123 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:12,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:12,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:12,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:14,070 INFO L124 PetriNetUnfolderBase]: 3205/4859 cut-off events. [2024-06-04 18:23:14,070 INFO L125 PetriNetUnfolderBase]: For 591654/591666 co-relation queries the response was YES. [2024-06-04 18:23:14,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46878 conditions, 4859 events. 3205/4859 cut-off events. For 591654/591666 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26045 event pairs, 503 based on Foata normal form. 10/4863 useless extension candidates. Maximal degree in co-relation 46735. Up to 4687 conditions per place. [2024-06-04 18:23:14,126 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 484 selfloop transitions, 26 changer transitions 0/514 dead transitions. [2024-06-04 18:23:14,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 514 transitions, 9185 flow [2024-06-04 18:23:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:23:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:23:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-04 18:23:14,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-04 18:23:14,128 INFO L175 Difference]: Start difference. First operand has 303 places, 501 transitions, 8123 flow. Second operand 8 states and 121 transitions. [2024-06-04 18:23:14,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 514 transitions, 9185 flow [2024-06-04 18:23:15,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 514 transitions, 8627 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-04 18:23:15,664 INFO L231 Difference]: Finished difference. Result has 306 places, 501 transitions, 7622 flow [2024-06-04 18:23:15,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7565, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7622, PETRI_PLACES=306, PETRI_TRANSITIONS=501} [2024-06-04 18:23:15,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places. [2024-06-04 18:23:15,664 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 501 transitions, 7622 flow [2024-06-04 18:23:15,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:15,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:15,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:15,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 18:23:15,665 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:15,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash -931101190, now seen corresponding path program 6 times [2024-06-04 18:23:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951503369] [2024-06-04 18:23:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:23:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951503369] [2024-06-04 18:23:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951503369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:23:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321737109] [2024-06-04 18:23:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:22,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:23:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:22,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:23:22,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:23:22,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:22,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 501 transitions, 7622 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:22,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:22,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:22,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:24,383 INFO L124 PetriNetUnfolderBase]: 3311/5016 cut-off events. [2024-06-04 18:23:24,383 INFO L125 PetriNetUnfolderBase]: For 645304/645314 co-relation queries the response was YES. [2024-06-04 18:23:24,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48106 conditions, 5016 events. 3311/5016 cut-off events. For 645304/645314 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27032 event pairs, 558 based on Foata normal form. 6/5004 useless extension candidates. Maximal degree in co-relation 47962. Up to 3221 conditions per place. [2024-06-04 18:23:24,441 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 308 selfloop transitions, 228 changer transitions 0/540 dead transitions. [2024-06-04 18:23:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 540 transitions, 9709 flow [2024-06-04 18:23:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:23:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:23:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 18:23:24,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 18:23:24,442 INFO L175 Difference]: Start difference. First operand has 306 places, 501 transitions, 7622 flow. Second operand 8 states and 143 transitions. [2024-06-04 18:23:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 540 transitions, 9709 flow [2024-06-04 18:23:26,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 540 transitions, 9630 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 18:23:26,146 INFO L231 Difference]: Finished difference. Result has 308 places, 522 transitions, 8496 flow [2024-06-04 18:23:26,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7543, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8496, PETRI_PLACES=308, PETRI_TRANSITIONS=522} [2024-06-04 18:23:26,146 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2024-06-04 18:23:26,146 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 522 transitions, 8496 flow [2024-06-04 18:23:26,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:26,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:26,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:26,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 18:23:26,147 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:26,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1258618890, now seen corresponding path program 7 times [2024-06-04 18:23:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:26,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262617729] [2024-06-04 18:23:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:23:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262617729] [2024-06-04 18:23:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262617729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:23:33,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344103588] [2024-06-04 18:23:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:33,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:23:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:23:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:23:33,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:33,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 522 transitions, 8496 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:33,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:33,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:33,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:35,398 INFO L124 PetriNetUnfolderBase]: 3307/5011 cut-off events. [2024-06-04 18:23:35,398 INFO L125 PetriNetUnfolderBase]: For 650847/650857 co-relation queries the response was YES. [2024-06-04 18:23:35,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49248 conditions, 5011 events. 3307/5011 cut-off events. For 650847/650857 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 26978 event pairs, 520 based on Foata normal form. 7/5003 useless extension candidates. Maximal degree in co-relation 49102. Up to 4513 conditions per place. [2024-06-04 18:23:35,462 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 436 selfloop transitions, 105 changer transitions 0/545 dead transitions. [2024-06-04 18:23:35,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 545 transitions, 10002 flow [2024-06-04 18:23:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:23:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:23:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-04 18:23:35,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-04 18:23:35,463 INFO L175 Difference]: Start difference. First operand has 308 places, 522 transitions, 8496 flow. Second operand 9 states and 145 transitions. [2024-06-04 18:23:35,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 545 transitions, 10002 flow [2024-06-04 18:23:37,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 545 transitions, 9676 flow, removed 75 selfloop flow, removed 3 redundant places. [2024-06-04 18:23:37,430 INFO L231 Difference]: Finished difference. Result has 315 places, 533 transitions, 8655 flow [2024-06-04 18:23:37,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8178, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8655, PETRI_PLACES=315, PETRI_TRANSITIONS=533} [2024-06-04 18:23:37,431 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places. [2024-06-04 18:23:37,431 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 533 transitions, 8655 flow [2024-06-04 18:23:37,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:37,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:37,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:37,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 18:23:37,431 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:37,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1092023184, now seen corresponding path program 1 times [2024-06-04 18:23:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20935180] [2024-06-04 18:23:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:23:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20935180] [2024-06-04 18:23:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20935180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:23:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666917007] [2024-06-04 18:23:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:23:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:23:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:23:45,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:45,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 533 transitions, 8655 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:45,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:45,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:45,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:46,893 INFO L124 PetriNetUnfolderBase]: 3315/5022 cut-off events. [2024-06-04 18:23:46,893 INFO L125 PetriNetUnfolderBase]: For 663610/663614 co-relation queries the response was YES. [2024-06-04 18:23:46,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49626 conditions, 5022 events. 3315/5022 cut-off events. For 663610/663614 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 27025 event pairs, 494 based on Foata normal form. 3/5022 useless extension candidates. Maximal degree in co-relation 49477. Up to 4839 conditions per place. [2024-06-04 18:23:46,950 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 533 selfloop transitions, 19 changer transitions 0/556 dead transitions. [2024-06-04 18:23:46,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 556 transitions, 9887 flow [2024-06-04 18:23:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:23:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:23:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-04 18:23:46,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-04 18:23:46,951 INFO L175 Difference]: Start difference. First operand has 315 places, 533 transitions, 8655 flow. Second operand 9 states and 136 transitions. [2024-06-04 18:23:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 556 transitions, 9887 flow [2024-06-04 18:23:48,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 556 transitions, 9624 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-04 18:23:48,330 INFO L231 Difference]: Finished difference. Result has 318 places, 535 transitions, 8507 flow [2024-06-04 18:23:48,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8392, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8507, PETRI_PLACES=318, PETRI_TRANSITIONS=535} [2024-06-04 18:23:48,330 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places. [2024-06-04 18:23:48,331 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 535 transitions, 8507 flow [2024-06-04 18:23:48,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:48,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:48,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 18:23:48,331 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:48,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 289937262, now seen corresponding path program 1 times [2024-06-04 18:23:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454198831] [2024-06-04 18:23:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:23:55,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-04 18:23:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:23:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454198831] [2024-06-04 18:23:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454198831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:23:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:23:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:23:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526851989] [2024-06-04 18:23:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:23:55,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:23:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:23:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:23:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:23:55,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:23:55,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 535 transitions, 8507 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:55,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:23:55,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:23:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:23:56,844 INFO L124 PetriNetUnfolderBase]: 3308/4998 cut-off events. [2024-06-04 18:23:56,844 INFO L125 PetriNetUnfolderBase]: For 667965/667969 co-relation queries the response was YES. [2024-06-04 18:23:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49100 conditions, 4998 events. 3308/4998 cut-off events. For 667965/667969 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 26829 event pairs, 485 based on Foata normal form. 4/4980 useless extension candidates. Maximal degree in co-relation 48950. Up to 4316 conditions per place. [2024-06-04 18:23:56,907 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 430 selfloop transitions, 122 changer transitions 0/556 dead transitions. [2024-06-04 18:23:56,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 556 transitions, 9855 flow [2024-06-04 18:23:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:23:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:23:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:23:56,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:23:56,909 INFO L175 Difference]: Start difference. First operand has 318 places, 535 transitions, 8507 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:23:56,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 556 transitions, 9855 flow [2024-06-04 18:23:58,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 556 transitions, 9696 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-04 18:23:58,845 INFO L231 Difference]: Finished difference. Result has 319 places, 535 transitions, 8613 flow [2024-06-04 18:23:58,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8348, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8613, PETRI_PLACES=319, PETRI_TRANSITIONS=535} [2024-06-04 18:23:58,845 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 277 predicate places. [2024-06-04 18:23:58,846 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 535 transitions, 8613 flow [2024-06-04 18:23:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:23:58,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:23:58,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:23:58,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 18:23:58,846 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:23:58,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:23:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 289937138, now seen corresponding path program 2 times [2024-06-04 18:23:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:23:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532724898] [2024-06-04 18:23:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:23:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:23:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:24:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:24:05,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:24:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532724898] [2024-06-04 18:24:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532724898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:24:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:24:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:24:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118025987] [2024-06-04 18:24:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:24:05,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:24:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:24:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:24:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:24:06,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:24:06,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 535 transitions, 8613 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:06,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:24:06,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:24:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:24:07,682 INFO L124 PetriNetUnfolderBase]: 3316/5033 cut-off events. [2024-06-04 18:24:07,683 INFO L125 PetriNetUnfolderBase]: For 682946/682950 co-relation queries the response was YES. [2024-06-04 18:24:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49773 conditions, 5033 events. 3316/5033 cut-off events. For 682946/682950 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27207 event pairs, 475 based on Foata normal form. 3/5033 useless extension candidates. Maximal degree in co-relation 49622. Up to 4825 conditions per place. [2024-06-04 18:24:07,740 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 531 selfloop transitions, 26 changer transitions 0/561 dead transitions. [2024-06-04 18:24:07,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 561 transitions, 9867 flow [2024-06-04 18:24:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:24:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:24:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-04 18:24:07,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-04 18:24:07,741 INFO L175 Difference]: Start difference. First operand has 319 places, 535 transitions, 8613 flow. Second operand 9 states and 141 transitions. [2024-06-04 18:24:07,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 561 transitions, 9867 flow [2024-06-04 18:24:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 561 transitions, 9531 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 18:24:09,477 INFO L231 Difference]: Finished difference. Result has 320 places, 537 transitions, 8411 flow [2024-06-04 18:24:09,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8277, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8411, PETRI_PLACES=320, PETRI_TRANSITIONS=537} [2024-06-04 18:24:09,477 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-04 18:24:09,477 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 537 transitions, 8411 flow [2024-06-04 18:24:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:09,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:24:09,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:24:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 18:24:09,478 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:24:09,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:24:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1583295964, now seen corresponding path program 3 times [2024-06-04 18:24:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:24:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728302229] [2024-06-04 18:24:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:24:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:24:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:24:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:24:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:24:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728302229] [2024-06-04 18:24:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728302229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:24:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:24:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:24:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879679218] [2024-06-04 18:24:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:24:16,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:24:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:24:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:24:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:24:16,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:24:16,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 537 transitions, 8411 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:16,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:24:16,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:24:16,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:24:18,448 INFO L124 PetriNetUnfolderBase]: 3324/5041 cut-off events. [2024-06-04 18:24:18,448 INFO L125 PetriNetUnfolderBase]: For 696926/696930 co-relation queries the response was YES. [2024-06-04 18:24:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49479 conditions, 5041 events. 3324/5041 cut-off events. For 696926/696930 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 27226 event pairs, 498 based on Foata normal form. 3/5041 useless extension candidates. Maximal degree in co-relation 49329. Up to 4822 conditions per place. [2024-06-04 18:24:18,509 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 526 selfloop transitions, 31 changer transitions 0/561 dead transitions. [2024-06-04 18:24:18,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 561 transitions, 9663 flow [2024-06-04 18:24:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:24:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:24:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-04 18:24:18,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-04 18:24:18,511 INFO L175 Difference]: Start difference. First operand has 320 places, 537 transitions, 8411 flow. Second operand 9 states and 141 transitions. [2024-06-04 18:24:18,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 561 transitions, 9663 flow [2024-06-04 18:24:19,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 561 transitions, 9547 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-04 18:24:19,932 INFO L231 Difference]: Finished difference. Result has 322 places, 539 transitions, 8442 flow [2024-06-04 18:24:19,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8295, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8442, PETRI_PLACES=322, PETRI_TRANSITIONS=539} [2024-06-04 18:24:19,932 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-04 18:24:19,933 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 539 transitions, 8442 flow [2024-06-04 18:24:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:19,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:24:19,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:24:19,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 18:24:19,933 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:24:19,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:24:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash 564629282, now seen corresponding path program 1 times [2024-06-04 18:24:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:24:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905317554] [2024-06-04 18:24:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:24:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:24:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:24:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:24:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:24:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905317554] [2024-06-04 18:24:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905317554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:24:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:24:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:24:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81060511] [2024-06-04 18:24:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:24:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:24:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:24:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:24:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:24:27,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:24:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 539 transitions, 8442 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:27,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:24:27,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:24:27,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:24:28,989 INFO L124 PetriNetUnfolderBase]: 3869/5893 cut-off events. [2024-06-04 18:24:28,989 INFO L125 PetriNetUnfolderBase]: For 1192660/1192664 co-relation queries the response was YES. [2024-06-04 18:24:29,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58709 conditions, 5893 events. 3869/5893 cut-off events. For 1192660/1192664 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 32750 event pairs, 326 based on Foata normal form. 83/5954 useless extension candidates. Maximal degree in co-relation 58558. Up to 3032 conditions per place. [2024-06-04 18:24:29,057 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 427 selfloop transitions, 180 changer transitions 0/611 dead transitions. [2024-06-04 18:24:29,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 611 transitions, 10830 flow [2024-06-04 18:24:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:24:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:24:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-04 18:24:29,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458980044345898 [2024-06-04 18:24:29,058 INFO L175 Difference]: Start difference. First operand has 322 places, 539 transitions, 8442 flow. Second operand 11 states and 207 transitions. [2024-06-04 18:24:29,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 611 transitions, 10830 flow [2024-06-04 18:24:31,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 611 transitions, 10699 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-04 18:24:31,026 INFO L231 Difference]: Finished difference. Result has 329 places, 556 transitions, 9311 flow [2024-06-04 18:24:31,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8311, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9311, PETRI_PLACES=329, PETRI_TRANSITIONS=556} [2024-06-04 18:24:31,027 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 287 predicate places. [2024-06-04 18:24:31,027 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 556 transitions, 9311 flow [2024-06-04 18:24:31,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:24:31,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:24:31,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:24:31,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 18:24:31,027 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:24:31,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:24:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1167091604, now seen corresponding path program 2 times [2024-06-04 18:24:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:24:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985227362] [2024-06-04 18:24:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:24:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:24:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15