./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 17:39:27,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:39:27,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:39:27,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:39:27,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:39:27,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:39:27,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:39:27,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:39:27,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:39:27,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:39:27,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:39:27,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:39:27,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:39:27,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:39:27,253 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:39:27,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:39:27,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:39:27,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:39:27,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:39:27,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:39:27,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:39:27,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:39:27,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:39:27,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:39:27,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:39:27,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:39:27,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:39:27,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:39:27,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:39:27,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:39:27,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:39:27,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:39:27,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:39:27,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:39:27,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:39:27,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:39:27,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:39:27,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:39:27,260 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 17:39:27,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:39:27,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:39:27,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:39:27,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:39:27,484 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:39:27,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:39:28,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:39:28,628 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:39:28,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:39:28,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82d40cea/b568f0455b484355a51c94a7b1d0d3fa/FLAG45b6a8fa9 [2024-06-04 17:39:28,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82d40cea/b568f0455b484355a51c94a7b1d0d3fa [2024-06-04 17:39:28,665 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:39:28,665 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:39:28,667 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-04 17:39:28,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:39:28,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:39:28,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:39:28,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:39:28,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:39:28,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:39:28" (1/2) ... [2024-06-04 17:39:28,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373d8620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:39:28, skipping insertion in model container [2024-06-04 17:39:28,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:39:28" (1/2) ... [2024-06-04 17:39:28,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7472da2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:39:28, skipping insertion in model container [2024-06-04 17:39:28,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:39:28" (2/2) ... [2024-06-04 17:39:28,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373d8620 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:39:28, skipping insertion in model container [2024-06-04 17:39:28,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:39:28" (2/2) ... [2024-06-04 17:39:28,834 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:39:28,915 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:39:28,916 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (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_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) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )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) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (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 )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (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_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-04 17:39:28,917 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (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_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) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )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) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (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 )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (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_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-04 17:39:28,917 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (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_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) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )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) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (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 )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (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_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && 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) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-04 17:39:28,918 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:39:28,918 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-04 17:39:28,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:39:29,242 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:39:29,254 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:39:29,558 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:39:29,592 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:39:29,592 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:39:29 WrapperNode [2024-06-04 17:39:29,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:39:29,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:39:29,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:39:29,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:39:29,599 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,643 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,847 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-04 17:39:29,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:39:29,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:39:29,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:39:29,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:39:29,857 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,858 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,883 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,941 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 17:39:29,941 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,941 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,992 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 05:39:29" (1/1) ... [2024-06-04 17:39:29,994 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 05:39:29" (1/1) ... [2024-06-04 17:39:30,003 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 05:39:29" (1/1) ... [2024-06-04 17:39:30,007 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 05:39:29" (1/1) ... [2024-06-04 17:39:30,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:39:30,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:39:30,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:39:30,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:39:30,040 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 05:39:29" (1/1) ... [2024-06-04 17:39:30,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:39:30,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:39:30,063 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 17:39:30,084 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 17:39:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:39:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:39:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:39:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:39:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:39:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:39:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:39:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:39:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:39:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:39:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:39:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:39:30,097 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 17:39:30,217 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:39:30,219 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:39:31,300 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:39:31,302 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:39:31,517 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:39:31,518 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:39:31,518 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:39:31 BoogieIcfgContainer [2024-06-04 17:39:31,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:39:31,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:39:31,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:39:31,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:39:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:39:28" (1/4) ... [2024-06-04 17:39:31,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818f05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:39:31, skipping insertion in model container [2024-06-04 17:39:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:39:28" (2/4) ... [2024-06-04 17:39:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818f05e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:39:31, skipping insertion in model container [2024-06-04 17:39:31,523 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 05:39:29" (3/4) ... [2024-06-04 17:39:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818f05e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:39:31, skipping insertion in model container [2024-06-04 17:39:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:39:31" (4/4) ... [2024-06-04 17:39:31,524 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:39:31,536 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:39:31,537 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:39:31,537 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:39:31,625 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:39:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:39:31,711 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 17:39:31,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:39:31,714 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 62 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 17:39:31,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:39:31,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 17:39:31,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:39:31,734 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;@3efd9e74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:39:31,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:39:31,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:39:31,742 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 17:39:31,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:39:31,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:31,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:39:31,744 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 17:39:31,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1624549176, now seen corresponding path program 1 times [2024-06-04 17:39:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197197778] [2024-06-04 17:39:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:36,471 INFO 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 17:39:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197197778] [2024-06-04 17:39:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197197778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:36,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:39:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412810096] [2024-06-04 17:39:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:36,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:39:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:36,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:39:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:39:36,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 17:39:36,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:36,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:36,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 17:39:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:37,239 INFO L124 PetriNetUnfolderBase]: 1152/1803 cut-off events. [2024-06-04 17:39:37,239 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 17:39:37,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1803 events. 1152/1803 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8671 event pairs, 785 based on Foata normal form. 1/1759 useless extension candidates. Maximal degree in co-relation 3607. Up to 1732 conditions per place. [2024-06-04 17:39:37,255 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-04 17:39:37,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2024-06-04 17:39:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:39:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:39:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-04 17:39:37,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-06-04 17:39:37,266 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions. [2024-06-04 17:39:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2024-06-04 17:39:37,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:39:37,271 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-04 17:39:37,273 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 17:39:37,275 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-04 17:39:37,276 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-04 17:39:37,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:37,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:37,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:37,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:39:37,277 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 17:39:37,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2118585753, now seen corresponding path program 1 times [2024-06-04 17:39:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253730276] [2024-06-04 17:39:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:39:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253730276] [2024-06-04 17:39:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253730276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:40,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:39:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232713225] [2024-06-04 17:39:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:40,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:39:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:39:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:39:40,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:39:40,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 17:39:40,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:40,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:39:40,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:41,139 INFO L124 PetriNetUnfolderBase]: 1353/2041 cut-off events. [2024-06-04 17:39:41,139 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2024-06-04 17:39:41,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 2041 events. 1353/2041 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9444 event pairs, 795 based on Foata normal form. 3/2043 useless extension candidates. Maximal degree in co-relation 4684. Up to 2005 conditions per place. [2024-06-04 17:39:41,149 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-04 17:39:41,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-04 17:39:41,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:39:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:39:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-04 17:39:41,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-04 17:39:41,151 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-04 17:39:41,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-04 17:39:41,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:39:41,152 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-04 17:39:41,153 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 17:39:41,153 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-04 17:39:41,153 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-04 17:39:41,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 17:39:41,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:41,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:41,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:39:41,154 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 17:39:41,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1251647469, now seen corresponding path program 1 times [2024-06-04 17:39:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088929994] [2024-06-04 17:39:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:44,368 INFO 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 17:39:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088929994] [2024-06-04 17:39:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088929994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:44,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:39:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308648798] [2024-06-04 17:39:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:44,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:39:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:39:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:39:44,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:39:44,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:44,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:44,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:39:44,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:45,216 INFO L124 PetriNetUnfolderBase]: 1361/2061 cut-off events. [2024-06-04 17:39:45,216 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-06-04 17:39:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5273 conditions, 2061 events. 1361/2061 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9683 event pairs, 569 based on Foata normal form. 5/2064 useless extension candidates. Maximal degree in co-relation 5256. Up to 1951 conditions per place. [2024-06-04 17:39:45,228 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 54 selfloop transitions, 16 changer transitions 0/74 dead transitions. [2024-06-04 17:39:45,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 396 flow [2024-06-04 17:39:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:39:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:39:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-04 17:39:45,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560975609756098 [2024-06-04 17:39:45,233 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 114 transitions. [2024-06-04 17:39:45,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 396 flow [2024-06-04 17:39:45,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:39:45,237 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow [2024-06-04 17:39:45,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-04 17:39:45,238 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-04 17:39:45,238 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow [2024-06-04 17:39:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:45,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:45,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:39:45,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:39:45,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -242922564, now seen corresponding path program 1 times [2024-06-04 17:39:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661006179] [2024-06-04 17:39:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:48,592 INFO 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 17:39:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661006179] [2024-06-04 17:39:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661006179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:39:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382909281] [2024-06-04 17:39:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:48,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:39:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:39:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:39:48,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:39:48,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:48,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:48,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:39:48,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:49,605 INFO L124 PetriNetUnfolderBase]: 1373/2081 cut-off events. [2024-06-04 17:39:49,605 INFO L125 PetriNetUnfolderBase]: For 2777/2780 co-relation queries the response was YES. [2024-06-04 17:39:49,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6303 conditions, 2081 events. 1373/2081 cut-off events. For 2777/2780 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9787 event pairs, 405 based on Foata normal form. 12/2091 useless extension candidates. Maximal degree in co-relation 6283. Up to 1919 conditions per place. [2024-06-04 17:39:49,616 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 58 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2024-06-04 17:39:49,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 499 flow [2024-06-04 17:39:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:39:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:39:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-04 17:39:49,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2024-06-04 17:39:49,620 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 130 transitions. [2024-06-04 17:39:49,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 499 flow [2024-06-04 17:39:49,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 491 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 17:39:49,627 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 291 flow [2024-06-04 17:39:49,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-04 17:39:49,627 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-04 17:39:49,628 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 291 flow [2024-06-04 17:39:49,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:39:49,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:49,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:49,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:39:49,629 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 17:39:49,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1166650499, now seen corresponding path program 1 times [2024-06-04 17:39:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443554004] [2024-06-04 17:39:49,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:39:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443554004] [2024-06-04 17:39:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443554004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:55,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:39:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709338014] [2024-06-04 17:39:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:55,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:39:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:39:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:39:55,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:39:55,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 17:39:55,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:55,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:39:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:56,522 INFO L124 PetriNetUnfolderBase]: 1161/1822 cut-off events. [2024-06-04 17:39:56,523 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2024-06-04 17:39:56,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5997 conditions, 1822 events. 1161/1822 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8811 event pairs, 463 based on Foata normal form. 2/1823 useless extension candidates. Maximal degree in co-relation 5974. Up to 1739 conditions per place. [2024-06-04 17:39:56,535 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 49 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-06-04 17:39:56,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 433 flow [2024-06-04 17:39:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:39:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:39:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-04 17:39:56,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:39:56,536 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 291 flow. Second operand 5 states and 90 transitions. [2024-06-04 17:39:56,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 433 flow [2024-06-04 17:39:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 383 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:39:56,542 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 265 flow [2024-06-04 17:39:56,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-04 17:39:56,544 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-04 17:39:56,545 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 265 flow [2024-06-04 17:39:56,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 17:39:56,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:56,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:56,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:39:56,550 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 17:39:56,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1840589541, now seen corresponding path program 1 times [2024-06-04 17:39:56,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:56,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294404144] [2024-06-04 17:39:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:56,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:40:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294404144] [2024-06-04 17:40:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294404144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:40:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315300627] [2024-06-04 17:40:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:05,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:40:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:40:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:40:05,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:40:05,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 17:40:05,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:05,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:40:05,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:06,056 INFO L124 PetriNetUnfolderBase]: 1151/1844 cut-off events. [2024-06-04 17:40:06,056 INFO L125 PetriNetUnfolderBase]: For 4007/4007 co-relation queries the response was YES. [2024-06-04 17:40:06,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 1844 events. 1151/1844 cut-off events. For 4007/4007 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8925 event pairs, 433 based on Foata normal form. 4/1847 useless extension candidates. Maximal degree in co-relation 5960. Up to 1707 conditions per place. [2024-06-04 17:40:06,070 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2024-06-04 17:40:06,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 453 flow [2024-06-04 17:40:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:40:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:40:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 17:40:06,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-04 17:40:06,072 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 265 flow. Second operand 6 states and 107 transitions. [2024-06-04 17:40:06,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 453 flow [2024-06-04 17:40:06,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 431 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:40:06,076 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 297 flow [2024-06-04 17:40:06,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-04 17:40:06,079 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-04 17:40:06,079 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 297 flow [2024-06-04 17:40:06,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 17:40:06,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:06,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:06,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:40:06,080 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 17:40:06,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1229421638, now seen corresponding path program 1 times [2024-06-04 17:40:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:06,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622980032] [2024-06-04 17:40:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:11,070 INFO 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 17:40:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622980032] [2024-06-04 17:40:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622980032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:40:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973833855] [2024-06-04 17:40:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:40:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:40:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:40:11,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:11,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 297 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 17:40:11,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:11,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:11,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:12,019 INFO L124 PetriNetUnfolderBase]: 1364/2069 cut-off events. [2024-06-04 17:40:12,019 INFO L125 PetriNetUnfolderBase]: For 6210/6216 co-relation queries the response was YES. [2024-06-04 17:40:12,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7354 conditions, 2069 events. 1364/2069 cut-off events. For 6210/6216 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9610 event pairs, 539 based on Foata normal form. 8/2075 useless extension candidates. Maximal degree in co-relation 7329. Up to 1956 conditions per place. [2024-06-04 17:40:12,032 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 54 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-04 17:40:12,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 539 flow [2024-06-04 17:40:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:40:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:40:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 17:40:12,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-04 17:40:12,034 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 297 flow. Second operand 6 states and 110 transitions. [2024-06-04 17:40:12,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 539 flow [2024-06-04 17:40:12,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 509 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:40:12,039 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 339 flow [2024-06-04 17:40:12,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-04 17:40:12,040 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-04 17:40:12,040 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 339 flow [2024-06-04 17:40:12,040 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 17:40:12,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:12,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:12,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:40:12,041 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 17:40:12,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -163743938, now seen corresponding path program 2 times [2024-06-04 17:40:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629957359] [2024-06-04 17:40:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:18,874 INFO 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 17:40:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629957359] [2024-06-04 17:40:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629957359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:40:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810324865] [2024-06-04 17:40:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:18,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:40:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:40:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:40:18,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:18,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 339 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 17:40:18,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:18,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:18,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:19,791 INFO L124 PetriNetUnfolderBase]: 1352/2042 cut-off events. [2024-06-04 17:40:19,791 INFO L125 PetriNetUnfolderBase]: For 7414/7414 co-relation queries the response was YES. [2024-06-04 17:40:19,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7493 conditions, 2042 events. 1352/2042 cut-off events. For 7414/7414 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9406 event pairs, 553 based on Foata normal form. 2/2039 useless extension candidates. Maximal degree in co-relation 7467. Up to 1940 conditions per place. [2024-06-04 17:40:19,803 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 48 selfloop transitions, 20 changer transitions 0/72 dead transitions. [2024-06-04 17:40:19,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 513 flow [2024-06-04 17:40:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:40:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:40:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 17:40:19,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 17:40:19,806 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 339 flow. Second operand 6 states and 106 transitions. [2024-06-04 17:40:19,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 513 flow [2024-06-04 17:40:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 484 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:40:19,811 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 358 flow [2024-06-04 17:40:19,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-06-04 17:40:19,811 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-04 17:40:19,811 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 358 flow [2024-06-04 17:40:19,812 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 17:40:19,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:19,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:19,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:40:19,812 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 17:40:19,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -169012516, now seen corresponding path program 1 times [2024-06-04 17:40:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230741925] [2024-06-04 17:40:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:28,534 INFO 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 17:40:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230741925] [2024-06-04 17:40:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230741925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:28,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:40:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974359276] [2024-06-04 17:40:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:28,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:40:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:40:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:40:28,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:28,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 358 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 17:40:28,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:28,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:29,632 INFO L124 PetriNetUnfolderBase]: 1526/2312 cut-off events. [2024-06-04 17:40:29,632 INFO L125 PetriNetUnfolderBase]: For 10037/10043 co-relation queries the response was YES. [2024-06-04 17:40:29,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 2312 events. 1526/2312 cut-off events. For 10037/10043 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10830 event pairs, 542 based on Foata normal form. 12/2322 useless extension candidates. Maximal degree in co-relation 8811. Up to 2040 conditions per place. [2024-06-04 17:40:29,642 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 74 selfloop transitions, 40 changer transitions 0/118 dead transitions. [2024-06-04 17:40:29,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 118 transitions, 931 flow [2024-06-04 17:40:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:40:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:40:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 17:40:29,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:40:29,645 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 358 flow. Second operand 9 states and 162 transitions. [2024-06-04 17:40:29,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 118 transitions, 931 flow [2024-06-04 17:40:29,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 118 transitions, 805 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:40:29,653 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 574 flow [2024-06-04 17:40:29,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2024-06-04 17:40:29,654 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-04 17:40:29,654 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 574 flow [2024-06-04 17:40:29,654 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 17:40:29,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:29,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:40:29,655 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 17:40:29,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash 542635996, now seen corresponding path program 2 times [2024-06-04 17:40:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025713700] [2024-06-04 17:40:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:38,873 INFO 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 17:40:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025713700] [2024-06-04 17:40:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025713700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:40:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336000368] [2024-06-04 17:40:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:40:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:40:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:40:39,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:39,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 574 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 17:40:39,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:39,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:39,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:39,996 INFO L124 PetriNetUnfolderBase]: 1598/2426 cut-off events. [2024-06-04 17:40:39,996 INFO L125 PetriNetUnfolderBase]: For 12988/12996 co-relation queries the response was YES. [2024-06-04 17:40:40,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 2426 events. 1598/2426 cut-off events. For 12988/12996 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11499 event pairs, 461 based on Foata normal form. 16/2440 useless extension candidates. Maximal degree in co-relation 10086. Up to 1988 conditions per place. [2024-06-04 17:40:40,008 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 54 changer transitions 0/127 dead transitions. [2024-06-04 17:40:40,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 127 transitions, 1054 flow [2024-06-04 17:40:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:40:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:40:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-04 17:40:40,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-04 17:40:40,011 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 574 flow. Second operand 9 states and 160 transitions. [2024-06-04 17:40:40,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 127 transitions, 1054 flow [2024-06-04 17:40:40,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 127 transitions, 1020 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 17:40:40,020 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 760 flow [2024-06-04 17:40:40,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=760, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2024-06-04 17:40:40,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2024-06-04 17:40:40,021 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 760 flow [2024-06-04 17:40:40,021 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 17:40:40,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:40,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:40,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:40:40,022 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 17:40:40,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash -808562152, now seen corresponding path program 3 times [2024-06-04 17:40:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639989562] [2024-06-04 17:40:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:48,912 INFO 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 17:40:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639989562] [2024-06-04 17:40:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639989562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:40:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237834307] [2024-06-04 17:40:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:48,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:40:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:40:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:40:49,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:49,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 760 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 17:40:49,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:49,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:50,001 INFO L124 PetriNetUnfolderBase]: 1620/2466 cut-off events. [2024-06-04 17:40:50,001 INFO L125 PetriNetUnfolderBase]: For 15973/15987 co-relation queries the response was YES. [2024-06-04 17:40:50,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11187 conditions, 2466 events. 1620/2466 cut-off events. For 15973/15987 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11778 event pairs, 456 based on Foata normal form. 16/2479 useless extension candidates. Maximal degree in co-relation 11154. Up to 1997 conditions per place. [2024-06-04 17:40:50,017 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 61 changer transitions 0/134 dead transitions. [2024-06-04 17:40:50,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 134 transitions, 1298 flow [2024-06-04 17:40:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:40:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:40:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-04 17:40:50,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-04 17:40:50,020 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 760 flow. Second operand 8 states and 148 transitions. [2024-06-04 17:40:50,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 134 transitions, 1298 flow [2024-06-04 17:40:50,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 1191 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 17:40:50,035 INFO L231 Difference]: Finished difference. Result has 79 places, 99 transitions, 883 flow [2024-06-04 17:40:50,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=883, PETRI_PLACES=79, PETRI_TRANSITIONS=99} [2024-06-04 17:40:50,036 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-04 17:40:50,036 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 99 transitions, 883 flow [2024-06-04 17:40:50,036 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 17:40:50,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:50,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:40:50,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:40:50,037 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 17:40:50,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613242, now seen corresponding path program 4 times [2024-06-04 17:40:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605249540] [2024-06-04 17:40:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:40:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:59,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605249540] [2024-06-04 17:40:59,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605249540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:59,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:59,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:40:59,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380418040] [2024-06-04 17:40:59,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:59,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:40:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:40:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:40:59,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:40:59,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 99 transitions, 883 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 17:40:59,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:59,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:40:59,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:00,602 INFO L124 PetriNetUnfolderBase]: 1604/2433 cut-off events. [2024-06-04 17:41:00,602 INFO L125 PetriNetUnfolderBase]: For 15317/15319 co-relation queries the response was YES. [2024-06-04 17:41:00,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10952 conditions, 2433 events. 1604/2433 cut-off events. For 15317/15319 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11568 event pairs, 469 based on Foata normal form. 6/2432 useless extension candidates. Maximal degree in co-relation 10917. Up to 1990 conditions per place. [2024-06-04 17:41:00,616 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 63 changer transitions 0/137 dead transitions. [2024-06-04 17:41:00,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1303 flow [2024-06-04 17:41:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:41:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:41:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-04 17:41:00,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-04 17:41:00,619 INFO L175 Difference]: Start difference. First operand has 79 places, 99 transitions, 883 flow. Second operand 10 states and 174 transitions. [2024-06-04 17:41:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1303 flow [2024-06-04 17:41:00,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 137 transitions, 1209 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-04 17:41:00,637 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 926 flow [2024-06-04 17:41:00,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=926, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2024-06-04 17:41:00,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-06-04 17:41:00,637 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 926 flow [2024-06-04 17:41:00,638 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 17:41:00,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:00,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:00,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:41:00,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:41:00,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1861367164, now seen corresponding path program 1 times [2024-06-04 17:41:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507198888] [2024-06-04 17:41:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:09,441 INFO 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 17:41:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507198888] [2024-06-04 17:41:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507198888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:09,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039368984] [2024-06-04 17:41:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:09,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:09,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:41:09,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 926 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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 17:41:09,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:09,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:41:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:10,428 INFO L124 PetriNetUnfolderBase]: 1389/2198 cut-off events. [2024-06-04 17:41:10,428 INFO L125 PetriNetUnfolderBase]: For 14671/14673 co-relation queries the response was YES. [2024-06-04 17:41:10,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10017 conditions, 2198 events. 1389/2198 cut-off events. For 14671/14673 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10765 event pairs, 432 based on Foata normal form. 4/2201 useless extension candidates. Maximal degree in co-relation 9981. Up to 2032 conditions per place. [2024-06-04 17:41:10,442 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 104 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2024-06-04 17:41:10,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 122 transitions, 1244 flow [2024-06-04 17:41:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:41:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:41:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 17:41:10,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:41:10,445 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 926 flow. Second operand 7 states and 123 transitions. [2024-06-04 17:41:10,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 122 transitions, 1244 flow [2024-06-04 17:41:10,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1063 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:41:10,460 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 804 flow [2024-06-04 17:41:10,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2024-06-04 17:41:10,461 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 17:41:10,461 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 804 flow [2024-06-04 17:41:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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 17:41:10,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:10,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:41:10,462 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:41:10,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash 101912899, now seen corresponding path program 1 times [2024-06-04 17:41:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:10,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821108415] [2024-06-04 17:41:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:18,746 INFO 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 17:41:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821108415] [2024-06-04 17:41:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821108415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:41:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058018954] [2024-06-04 17:41:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:18,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:41:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:41:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:41:18,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:41:18,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 17:41:18,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:18,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:41:18,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:19,459 INFO L124 PetriNetUnfolderBase]: 1386/2185 cut-off events. [2024-06-04 17:41:19,459 INFO L125 PetriNetUnfolderBase]: For 14811/14813 co-relation queries the response was YES. [2024-06-04 17:41:19,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9788 conditions, 2185 events. 1386/2185 cut-off events. For 14811/14813 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10665 event pairs, 453 based on Foata normal form. 1/2185 useless extension candidates. Maximal degree in co-relation 9751. Up to 2070 conditions per place. [2024-06-04 17:41:19,471 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 99 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2024-06-04 17:41:19,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 112 transitions, 1064 flow [2024-06-04 17:41:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:41:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:41:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 17:41:19,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-04 17:41:19,473 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 804 flow. Second operand 5 states and 86 transitions. [2024-06-04 17:41:19,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 112 transitions, 1064 flow [2024-06-04 17:41:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 1023 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:41:19,488 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 813 flow [2024-06-04 17:41:19,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=813, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2024-06-04 17:41:19,489 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 17:41:19,489 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 813 flow [2024-06-04 17:41:19,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 17:41:19,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:19,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:41:19,490 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 17:41:19,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1647521648, now seen corresponding path program 1 times [2024-06-04 17:41:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649136344] [2024-06-04 17:41:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:25,188 INFO 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 17:41:25,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:25,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649136344] [2024-06-04 17:41:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649136344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377111716] [2024-06-04 17:41:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:25,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:41:25,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 813 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 17:41:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:41:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:26,316 INFO L124 PetriNetUnfolderBase]: 1634/2495 cut-off events. [2024-06-04 17:41:26,316 INFO L125 PetriNetUnfolderBase]: For 20594/20603 co-relation queries the response was YES. [2024-06-04 17:41:26,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11578 conditions, 2495 events. 1634/2495 cut-off events. For 20594/20603 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11948 event pairs, 452 based on Foata normal form. 16/2509 useless extension candidates. Maximal degree in co-relation 11540. Up to 2008 conditions per place. [2024-06-04 17:41:26,330 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 81 selfloop transitions, 68 changer transitions 0/153 dead transitions. [2024-06-04 17:41:26,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1353 flow [2024-06-04 17:41:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:41:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:41:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-04 17:41:26,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-04 17:41:26,332 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 813 flow. Second operand 10 states and 178 transitions. [2024-06-04 17:41:26,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1353 flow [2024-06-04 17:41:26,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 153 transitions, 1325 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 17:41:26,347 INFO L231 Difference]: Finished difference. Result has 89 places, 110 transitions, 995 flow [2024-06-04 17:41:26,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=995, PETRI_PLACES=89, PETRI_TRANSITIONS=110} [2024-06-04 17:41:26,347 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-04 17:41:26,347 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 110 transitions, 995 flow [2024-06-04 17:41:26,347 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 17:41:26,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:26,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:26,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:41:26,348 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 17:41:26,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1219429866, now seen corresponding path program 2 times [2024-06-04 17:41:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37006919] [2024-06-04 17:41:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:31,874 INFO 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 17:41:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37006919] [2024-06-04 17:41:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37006919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907666800] [2024-06-04 17:41:31,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:31,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:31,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:41:31,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 110 transitions, 995 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 17:41:31,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:31,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:41:31,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:32,919 INFO L124 PetriNetUnfolderBase]: 1747/2673 cut-off events. [2024-06-04 17:41:32,919 INFO L125 PetriNetUnfolderBase]: For 24379/24384 co-relation queries the response was YES. [2024-06-04 17:41:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13204 conditions, 2673 events. 1747/2673 cut-off events. For 24379/24384 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13032 event pairs, 477 based on Foata normal form. 10/2677 useless extension candidates. Maximal degree in co-relation 13165. Up to 2092 conditions per place. [2024-06-04 17:41:32,934 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 85 selfloop transitions, 83 changer transitions 0/172 dead transitions. [2024-06-04 17:41:32,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 1856 flow [2024-06-04 17:41:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:41:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:41:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-04 17:41:32,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 17:41:32,937 INFO L175 Difference]: Start difference. First operand has 89 places, 110 transitions, 995 flow. Second operand 10 states and 175 transitions. [2024-06-04 17:41:32,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 1856 flow [2024-06-04 17:41:32,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 172 transitions, 1638 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:41:32,957 INFO L231 Difference]: Finished difference. Result has 94 places, 133 transitions, 1290 flow [2024-06-04 17:41:32,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1290, PETRI_PLACES=94, PETRI_TRANSITIONS=133} [2024-06-04 17:41:32,957 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-04 17:41:32,958 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 133 transitions, 1290 flow [2024-06-04 17:41:32,958 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 17:41:32,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:32,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:32,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:41:32,958 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:41:32,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 114650274, now seen corresponding path program 3 times [2024-06-04 17:41:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053346267] [2024-06-04 17:41:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:38,008 INFO 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 17:41:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053346267] [2024-06-04 17:41:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053346267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692935835] [2024-06-04 17:41:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:38,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:38,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:38,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:41:38,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 133 transitions, 1290 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 17:41:38,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:38,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:41:38,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:39,030 INFO L124 PetriNetUnfolderBase]: 1737/2659 cut-off events. [2024-06-04 17:41:39,030 INFO L125 PetriNetUnfolderBase]: For 26756/26761 co-relation queries the response was YES. [2024-06-04 17:41:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13396 conditions, 2659 events. 1737/2659 cut-off events. For 26756/26761 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13061 event pairs, 538 based on Foata normal form. 8/2665 useless extension candidates. Maximal degree in co-relation 13353. Up to 2259 conditions per place. [2024-06-04 17:41:39,044 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 94 selfloop transitions, 66 changer transitions 0/164 dead transitions. [2024-06-04 17:41:39,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 164 transitions, 1726 flow [2024-06-04 17:41:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:41:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:41:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 17:41:39,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 17:41:39,047 INFO L175 Difference]: Start difference. First operand has 94 places, 133 transitions, 1290 flow. Second operand 8 states and 143 transitions. [2024-06-04 17:41:39,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 164 transitions, 1726 flow [2024-06-04 17:41:39,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 164 transitions, 1624 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-04 17:41:39,071 INFO L231 Difference]: Finished difference. Result has 101 places, 135 transitions, 1385 flow [2024-06-04 17:41:39,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1385, PETRI_PLACES=101, PETRI_TRANSITIONS=135} [2024-06-04 17:41:39,071 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-04 17:41:39,072 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 135 transitions, 1385 flow [2024-06-04 17:41:39,072 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 17:41:39,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:39,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:39,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:41:39,072 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 17:41:39,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash 704377988, now seen corresponding path program 4 times [2024-06-04 17:41:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650450767] [2024-06-04 17:41:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:44,625 INFO 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 17:41:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650450767] [2024-06-04 17:41:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650450767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318604569] [2024-06-04 17:41:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:44,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:44,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:41:44,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 135 transitions, 1385 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 17:41:44,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:44,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:41:44,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:45,565 INFO L124 PetriNetUnfolderBase]: 1727/2648 cut-off events. [2024-06-04 17:41:45,566 INFO L125 PetriNetUnfolderBase]: For 29968/29973 co-relation queries the response was YES. [2024-06-04 17:41:45,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13552 conditions, 2648 events. 1727/2648 cut-off events. For 29968/29973 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12931 event pairs, 503 based on Foata normal form. 8/2641 useless extension candidates. Maximal degree in co-relation 13506. Up to 2076 conditions per place. [2024-06-04 17:41:45,580 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 74 selfloop transitions, 79 changer transitions 0/157 dead transitions. [2024-06-04 17:41:45,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 157 transitions, 1757 flow [2024-06-04 17:41:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:41:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:41:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:41:45,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-04 17:41:45,581 INFO L175 Difference]: Start difference. First operand has 101 places, 135 transitions, 1385 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:41:45,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 157 transitions, 1757 flow [2024-06-04 17:41:45,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 157 transitions, 1650 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:41:45,605 INFO L231 Difference]: Finished difference. Result has 104 places, 135 transitions, 1444 flow [2024-06-04 17:41:45,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1444, PETRI_PLACES=104, PETRI_TRANSITIONS=135} [2024-06-04 17:41:45,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-04 17:41:45,606 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 135 transitions, 1444 flow [2024-06-04 17:41:45,606 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 17:41:45,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:45,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:45,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:41:45,606 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 17:41:45,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1539265391, now seen corresponding path program 1 times [2024-06-04 17:41:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131904735] [2024-06-04 17:41:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:54,658 INFO 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 17:41:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131904735] [2024-06-04 17:41:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131904735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:41:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711788650] [2024-06-04 17:41:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:54,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:41:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:41:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:41:54,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:41:54,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 135 transitions, 1444 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 17:41:54,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:54,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:41:54,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:55,676 INFO L124 PetriNetUnfolderBase]: 1804/2774 cut-off events. [2024-06-04 17:41:55,677 INFO L125 PetriNetUnfolderBase]: For 34409/34414 co-relation queries the response was YES. [2024-06-04 17:41:55,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14353 conditions, 2774 events. 1804/2774 cut-off events. For 34409/34414 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13828 event pairs, 501 based on Foata normal form. 8/2780 useless extension candidates. Maximal degree in co-relation 14306. Up to 2431 conditions per place. [2024-06-04 17:41:55,693 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 124 selfloop transitions, 46 changer transitions 0/174 dead transitions. [2024-06-04 17:41:55,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 174 transitions, 2010 flow [2024-06-04 17:41:55,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:41:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:41:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 17:41:55,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:41:55,698 INFO L175 Difference]: Start difference. First operand has 104 places, 135 transitions, 1444 flow. Second operand 8 states and 144 transitions. [2024-06-04 17:41:55,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 174 transitions, 2010 flow [2024-06-04 17:41:55,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 174 transitions, 1831 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-04 17:41:55,739 INFO L231 Difference]: Finished difference. Result has 105 places, 142 transitions, 1440 flow [2024-06-04 17:41:55,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1440, PETRI_PLACES=105, PETRI_TRANSITIONS=142} [2024-06-04 17:41:55,740 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-04 17:41:55,740 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 142 transitions, 1440 flow [2024-06-04 17:41:55,740 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 17:41:55,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:55,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:55,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:41:55,741 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 17:41:55,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -504881647, now seen corresponding path program 2 times [2024-06-04 17:41:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:55,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578200898] [2024-06-04 17:41:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:02,013 INFO 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 17:42:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578200898] [2024-06-04 17:42:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578200898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052210378] [2024-06-04 17:42:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:02,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:02,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:02,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 142 transitions, 1440 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 17:42:02,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:02,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:02,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:03,156 INFO L124 PetriNetUnfolderBase]: 1812/2780 cut-off events. [2024-06-04 17:42:03,156 INFO L125 PetriNetUnfolderBase]: For 36761/36766 co-relation queries the response was YES. [2024-06-04 17:42:03,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14547 conditions, 2780 events. 1812/2780 cut-off events. For 36761/36766 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13761 event pairs, 502 based on Foata normal form. 8/2786 useless extension candidates. Maximal degree in co-relation 14498. Up to 2521 conditions per place. [2024-06-04 17:42:03,173 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 124 selfloop transitions, 44 changer transitions 0/172 dead transitions. [2024-06-04 17:42:03,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 1898 flow [2024-06-04 17:42:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 17:42:03,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 17:42:03,175 INFO L175 Difference]: Start difference. First operand has 105 places, 142 transitions, 1440 flow. Second operand 8 states and 141 transitions. [2024-06-04 17:42:03,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 1898 flow [2024-06-04 17:42:03,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 172 transitions, 1823 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:03,212 INFO L231 Difference]: Finished difference. Result has 109 places, 144 transitions, 1493 flow [2024-06-04 17:42:03,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1493, PETRI_PLACES=109, PETRI_TRANSITIONS=144} [2024-06-04 17:42:03,212 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places. [2024-06-04 17:42:03,212 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 144 transitions, 1493 flow [2024-06-04 17:42:03,212 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 17:42:03,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:03,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:03,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:42:03,213 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:42:03,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1931339511, now seen corresponding path program 3 times [2024-06-04 17:42:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807711515] [2024-06-04 17:42:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:09,934 INFO 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 17:42:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807711515] [2024-06-04 17:42:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807711515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:09,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358300903] [2024-06-04 17:42:09,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:09,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:09,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:10,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:10,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 144 transitions, 1493 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 17:42:10,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:10,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:11,062 INFO L124 PetriNetUnfolderBase]: 1929/2980 cut-off events. [2024-06-04 17:42:11,062 INFO L125 PetriNetUnfolderBase]: For 41626/41631 co-relation queries the response was YES. [2024-06-04 17:42:11,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15666 conditions, 2980 events. 1929/2980 cut-off events. For 41626/41631 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15151 event pairs, 389 based on Foata normal form. 6/2984 useless extension candidates. Maximal degree in co-relation 15615. Up to 2443 conditions per place. [2024-06-04 17:42:11,078 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 122 selfloop transitions, 67 changer transitions 0/193 dead transitions. [2024-06-04 17:42:11,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 193 transitions, 2237 flow [2024-06-04 17:42:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 17:42:11,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 17:42:11,081 INFO L175 Difference]: Start difference. First operand has 109 places, 144 transitions, 1493 flow. Second operand 8 states and 143 transitions. [2024-06-04 17:42:11,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 193 transitions, 2237 flow [2024-06-04 17:42:11,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 193 transitions, 2127 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:11,120 INFO L231 Difference]: Finished difference. Result has 113 places, 163 transitions, 1743 flow [2024-06-04 17:42:11,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1743, PETRI_PLACES=113, PETRI_TRANSITIONS=163} [2024-06-04 17:42:11,121 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-04 17:42:11,121 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 163 transitions, 1743 flow [2024-06-04 17:42:11,121 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 17:42:11,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:11,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:11,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:42:11,121 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 17:42:11,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 271891629, now seen corresponding path program 1 times [2024-06-04 17:42:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869567647] [2024-06-04 17:42:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869567647] [2024-06-04 17:42:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869567647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:42:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179930136] [2024-06-04 17:42:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:19,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:42:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:42:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:42:19,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:19,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 163 transitions, 1743 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 17:42:19,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:19,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:21,040 INFO L124 PetriNetUnfolderBase]: 2021/3127 cut-off events. [2024-06-04 17:42:21,041 INFO L125 PetriNetUnfolderBase]: For 51255/51260 co-relation queries the response was YES. [2024-06-04 17:42:21,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16990 conditions, 3127 events. 2021/3127 cut-off events. For 51255/51260 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16169 event pairs, 547 based on Foata normal form. 28/3153 useless extension candidates. Maximal degree in co-relation 16936. Up to 2565 conditions per place. [2024-06-04 17:42:21,061 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 134 selfloop transitions, 69 changer transitions 0/207 dead transitions. [2024-06-04 17:42:21,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 207 transitions, 2327 flow [2024-06-04 17:42:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:42:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:42:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-04 17:42:21,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658536585365854 [2024-06-04 17:42:21,064 INFO L175 Difference]: Start difference. First operand has 113 places, 163 transitions, 1743 flow. Second operand 10 states and 179 transitions. [2024-06-04 17:42:21,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 207 transitions, 2327 flow [2024-06-04 17:42:21,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 207 transitions, 2240 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:21,109 INFO L231 Difference]: Finished difference. Result has 119 places, 165 transitions, 1836 flow [2024-06-04 17:42:21,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1836, PETRI_PLACES=119, PETRI_TRANSITIONS=165} [2024-06-04 17:42:21,109 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-04 17:42:21,110 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 165 transitions, 1836 flow [2024-06-04 17:42:21,110 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 17:42:21,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:21,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:21,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:42:21,110 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:42:21,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1182357752, now seen corresponding path program 1 times [2024-06-04 17:42:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815804001] [2024-06-04 17:42:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:29,546 INFO 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 17:42:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815804001] [2024-06-04 17:42:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815804001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:42:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44790908] [2024-06-04 17:42:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:42:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:42:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:42:29,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:29,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 165 transitions, 1836 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 17:42:29,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:29,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:29,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:30,535 INFO L124 PetriNetUnfolderBase]: 2026/3147 cut-off events. [2024-06-04 17:42:30,536 INFO L125 PetriNetUnfolderBase]: For 50764/50764 co-relation queries the response was YES. [2024-06-04 17:42:30,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17505 conditions, 3147 events. 2026/3147 cut-off events. For 50764/50764 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16376 event pairs, 762 based on Foata normal form. 1/3147 useless extension candidates. Maximal degree in co-relation 17450. Up to 3014 conditions per place. [2024-06-04 17:42:30,559 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 166 selfloop transitions, 18 changer transitions 0/188 dead transitions. [2024-06-04 17:42:30,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 188 transitions, 2307 flow [2024-06-04 17:42:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 17:42:30,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-04 17:42:30,561 INFO L175 Difference]: Start difference. First operand has 119 places, 165 transitions, 1836 flow. Second operand 7 states and 116 transitions. [2024-06-04 17:42:30,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 188 transitions, 2307 flow [2024-06-04 17:42:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 188 transitions, 2155 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:42:30,662 INFO L231 Difference]: Finished difference. Result has 119 places, 171 transitions, 1793 flow [2024-06-04 17:42:30,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1793, PETRI_PLACES=119, PETRI_TRANSITIONS=171} [2024-06-04 17:42:30,662 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-04 17:42:30,663 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 171 transitions, 1793 flow [2024-06-04 17:42:30,663 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 17:42:30,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:30,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:42:30,663 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:42:30,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 582950797, now seen corresponding path program 4 times [2024-06-04 17:42:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761855712] [2024-06-04 17:42:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:36,544 INFO 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 17:42:36,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:36,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761855712] [2024-06-04 17:42:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761855712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:36,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747734871] [2024-06-04 17:42:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:36,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:36,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:36,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:36,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 171 transitions, 1793 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 17:42:36,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:36,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:36,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:37,761 INFO L124 PetriNetUnfolderBase]: 2060/3199 cut-off events. [2024-06-04 17:42:37,761 INFO L125 PetriNetUnfolderBase]: For 53444/53447 co-relation queries the response was YES. [2024-06-04 17:42:37,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17749 conditions, 3199 events. 2060/3199 cut-off events. For 53444/53447 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16625 event pairs, 568 based on Foata normal form. 10/3203 useless extension candidates. Maximal degree in co-relation 17692. Up to 2893 conditions per place. [2024-06-04 17:42:37,781 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 144 selfloop transitions, 53 changer transitions 0/201 dead transitions. [2024-06-04 17:42:37,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 201 transitions, 2372 flow [2024-06-04 17:42:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:42:37,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-04 17:42:37,783 INFO L175 Difference]: Start difference. First operand has 119 places, 171 transitions, 1793 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:42:37,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 201 transitions, 2372 flow [2024-06-04 17:42:37,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 201 transitions, 2311 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:37,834 INFO L231 Difference]: Finished difference. Result has 125 places, 180 transitions, 2014 flow [2024-06-04 17:42:37,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2014, PETRI_PLACES=125, PETRI_TRANSITIONS=180} [2024-06-04 17:42:37,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-04 17:42:37,835 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 180 transitions, 2014 flow [2024-06-04 17:42:37,835 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 17:42:37,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:37,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:37,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:42:37,835 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:42:37,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1663853055, now seen corresponding path program 5 times [2024-06-04 17:42:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666366233] [2024-06-04 17:42:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:43,384 INFO 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 17:42:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666366233] [2024-06-04 17:42:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666366233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032977630] [2024-06-04 17:42:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:43,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:43,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 180 transitions, 2014 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 17:42:43,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:43,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:43,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:44,537 INFO L124 PetriNetUnfolderBase]: 2047/3174 cut-off events. [2024-06-04 17:42:44,537 INFO L125 PetriNetUnfolderBase]: For 56338/56341 co-relation queries the response was YES. [2024-06-04 17:42:44,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18053 conditions, 3174 events. 2047/3174 cut-off events. For 56338/56341 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16404 event pairs, 408 based on Foata normal form. 8/3180 useless extension candidates. Maximal degree in co-relation 17993. Up to 2622 conditions per place. [2024-06-04 17:42:44,557 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 126 selfloop transitions, 73 changer transitions 0/203 dead transitions. [2024-06-04 17:42:44,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 203 transitions, 2490 flow [2024-06-04 17:42:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 17:42:44,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:42:44,559 INFO L175 Difference]: Start difference. First operand has 125 places, 180 transitions, 2014 flow. Second operand 7 states and 123 transitions. [2024-06-04 17:42:44,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 203 transitions, 2490 flow [2024-06-04 17:42:44,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 2342 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:44,618 INFO L231 Difference]: Finished difference. Result has 126 places, 180 transitions, 2032 flow [2024-06-04 17:42:44,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2032, PETRI_PLACES=126, PETRI_TRANSITIONS=180} [2024-06-04 17:42:44,619 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-04 17:42:44,619 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 180 transitions, 2032 flow [2024-06-04 17:42:44,619 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 17:42:44,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:44,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:44,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:42:44,619 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:42:44,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1782185883, now seen corresponding path program 2 times [2024-06-04 17:42:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620426941] [2024-06-04 17:42:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:53,526 INFO 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 17:42:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620426941] [2024-06-04 17:42:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620426941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:53,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:42:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022877978] [2024-06-04 17:42:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:53,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:42:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:53,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:42:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:42:53,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:42:53,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 180 transitions, 2032 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 17:42:53,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:53,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:42:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:54,957 INFO L124 PetriNetUnfolderBase]: 2139/3323 cut-off events. [2024-06-04 17:42:54,957 INFO L125 PetriNetUnfolderBase]: For 66333/66336 co-relation queries the response was YES. [2024-06-04 17:42:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19035 conditions, 3323 events. 2139/3323 cut-off events. For 66333/66336 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17435 event pairs, 476 based on Foata normal form. 26/3347 useless extension candidates. Maximal degree in co-relation 18974. Up to 2440 conditions per place. [2024-06-04 17:42:54,983 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 123 selfloop transitions, 96 changer transitions 0/223 dead transitions. [2024-06-04 17:42:54,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 223 transitions, 2644 flow [2024-06-04 17:42:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:42:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:42:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-04 17:42:54,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317073170731707 [2024-06-04 17:42:54,986 INFO L175 Difference]: Start difference. First operand has 126 places, 180 transitions, 2032 flow. Second operand 10 states and 177 transitions. [2024-06-04 17:42:54,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 223 transitions, 2644 flow [2024-06-04 17:42:55,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 223 transitions, 2476 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:42:55,047 INFO L231 Difference]: Finished difference. Result has 129 places, 182 transitions, 2108 flow [2024-06-04 17:42:55,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2108, PETRI_PLACES=129, PETRI_TRANSITIONS=182} [2024-06-04 17:42:55,047 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-04 17:42:55,047 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 182 transitions, 2108 flow [2024-06-04 17:42:55,047 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 17:42:55,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:55,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:42:55,048 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 17:42:55,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -857349214, now seen corresponding path program 2 times [2024-06-04 17:42:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048581722] [2024-06-04 17:42:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:03,714 INFO 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 17:43:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048581722] [2024-06-04 17:43:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048581722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851201149] [2024-06-04 17:43:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:03,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:03,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:03,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:43:03,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 182 transitions, 2108 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 17:43:03,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:03,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:43:03,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:04,784 INFO L124 PetriNetUnfolderBase]: 2144/3342 cut-off events. [2024-06-04 17:43:04,784 INFO L125 PetriNetUnfolderBase]: For 58431/58431 co-relation queries the response was YES. [2024-06-04 17:43:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19215 conditions, 3342 events. 2144/3342 cut-off events. For 58431/58431 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17800 event pairs, 790 based on Foata normal form. 1/3342 useless extension candidates. Maximal degree in co-relation 19155. Up to 3205 conditions per place. [2024-06-04 17:43:04,804 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 174 selfloop transitions, 20 changer transitions 0/198 dead transitions. [2024-06-04 17:43:04,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 198 transitions, 2570 flow [2024-06-04 17:43:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 17:43:04,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 17:43:04,805 INFO L175 Difference]: Start difference. First operand has 129 places, 182 transitions, 2108 flow. Second operand 6 states and 100 transitions. [2024-06-04 17:43:04,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 198 transitions, 2570 flow [2024-06-04 17:43:04,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 198 transitions, 2362 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:43:04,865 INFO L231 Difference]: Finished difference. Result has 127 places, 185 transitions, 1989 flow [2024-06-04 17:43:04,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1989, PETRI_PLACES=127, PETRI_TRANSITIONS=185} [2024-06-04 17:43:04,865 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-04 17:43:04,865 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 185 transitions, 1989 flow [2024-06-04 17:43:04,866 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 17:43:04,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:04,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:43:04,866 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:43:04,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash 435016553, now seen corresponding path program 3 times [2024-06-04 17:43:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900852228] [2024-06-04 17:43:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:13,750 INFO 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 17:43:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900852228] [2024-06-04 17:43:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900852228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878872482] [2024-06-04 17:43:13,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:13,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:13,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:43:13,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 185 transitions, 1989 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 17:43:13,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:13,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:43:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:15,055 INFO L124 PetriNetUnfolderBase]: 2161/3354 cut-off events. [2024-06-04 17:43:15,055 INFO L125 PetriNetUnfolderBase]: For 55531/55531 co-relation queries the response was YES. [2024-06-04 17:43:15,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18884 conditions, 3354 events. 2161/3354 cut-off events. For 55531/55531 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17604 event pairs, 493 based on Foata normal form. 4/3348 useless extension candidates. Maximal degree in co-relation 18823. Up to 2756 conditions per place. [2024-06-04 17:43:15,077 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 118 selfloop transitions, 96 changer transitions 0/218 dead transitions. [2024-06-04 17:43:15,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 218 transitions, 2557 flow [2024-06-04 17:43:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-04 17:43:15,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-04 17:43:15,080 INFO L175 Difference]: Start difference. First operand has 127 places, 185 transitions, 1989 flow. Second operand 9 states and 156 transitions. [2024-06-04 17:43:15,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 218 transitions, 2557 flow [2024-06-04 17:43:15,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 218 transitions, 2498 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:15,135 INFO L231 Difference]: Finished difference. Result has 132 places, 187 transitions, 2167 flow [2024-06-04 17:43:15,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2167, PETRI_PLACES=132, PETRI_TRANSITIONS=187} [2024-06-04 17:43:15,136 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-04 17:43:15,136 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 187 transitions, 2167 flow [2024-06-04 17:43:15,136 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 17:43:15,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:15,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:15,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:43:15,137 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 17:43:15,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 443356793, now seen corresponding path program 4 times [2024-06-04 17:43:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750098189] [2024-06-04 17:43:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750098189] [2024-06-04 17:43:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750098189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472554167] [2024-06-04 17:43:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:23,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:23,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:23,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:23,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:43:23,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 187 transitions, 2167 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 17:43:23,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:23,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:43:23,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:24,652 INFO L124 PetriNetUnfolderBase]: 2178/3381 cut-off events. [2024-06-04 17:43:24,652 INFO L125 PetriNetUnfolderBase]: For 57825/57825 co-relation queries the response was YES. [2024-06-04 17:43:24,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19400 conditions, 3381 events. 2178/3381 cut-off events. For 57825/57825 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17853 event pairs, 448 based on Foata normal form. 4/3375 useless extension candidates. Maximal degree in co-relation 19338. Up to 2415 conditions per place. [2024-06-04 17:43:24,674 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 119 selfloop transitions, 105 changer transitions 0/228 dead transitions. [2024-06-04 17:43:24,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 228 transitions, 2901 flow [2024-06-04 17:43:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 17:43:24,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:43:24,677 INFO L175 Difference]: Start difference. First operand has 132 places, 187 transitions, 2167 flow. Second operand 9 states and 162 transitions. [2024-06-04 17:43:24,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 228 transitions, 2901 flow [2024-06-04 17:43:24,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 228 transitions, 2684 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:24,735 INFO L231 Difference]: Finished difference. Result has 134 places, 191 transitions, 2243 flow [2024-06-04 17:43:24,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2243, PETRI_PLACES=134, PETRI_TRANSITIONS=191} [2024-06-04 17:43:24,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-04 17:43:24,736 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 191 transitions, 2243 flow [2024-06-04 17:43:24,736 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 17:43:24,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:24,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:24,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:43:24,737 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 17:43:24,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1991073413, now seen corresponding path program 5 times [2024-06-04 17:43:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160885258] [2024-06-04 17:43:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:34,004 INFO 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 17:43:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160885258] [2024-06-04 17:43:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160885258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563373442] [2024-06-04 17:43:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:34,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:34,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:43:34,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 191 transitions, 2243 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 17:43:34,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:34,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:43:34,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:35,395 INFO L124 PetriNetUnfolderBase]: 2170/3369 cut-off events. [2024-06-04 17:43:35,396 INFO L125 PetriNetUnfolderBase]: For 61446/61446 co-relation queries the response was YES. [2024-06-04 17:43:35,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19566 conditions, 3369 events. 2170/3369 cut-off events. For 61446/61446 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17716 event pairs, 491 based on Foata normal form. 4/3363 useless extension candidates. Maximal degree in co-relation 19503. Up to 2768 conditions per place. [2024-06-04 17:43:35,420 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 130 selfloop transitions, 97 changer transitions 0/231 dead transitions. [2024-06-04 17:43:35,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 231 transitions, 2835 flow [2024-06-04 17:43:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:43:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:43:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-04 17:43:35,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:43:35,422 INFO L175 Difference]: Start difference. First operand has 134 places, 191 transitions, 2243 flow. Second operand 11 states and 187 transitions. [2024-06-04 17:43:35,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 231 transitions, 2835 flow [2024-06-04 17:43:35,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 231 transitions, 2599 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:35,499 INFO L231 Difference]: Finished difference. Result has 139 places, 191 transitions, 2209 flow [2024-06-04 17:43:35,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2209, PETRI_PLACES=139, PETRI_TRANSITIONS=191} [2024-06-04 17:43:35,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-04 17:43:35,499 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 191 transitions, 2209 flow [2024-06-04 17:43:35,500 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 17:43:35,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:35,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:43:35,500 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:43:35,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -845921374, now seen corresponding path program 3 times [2024-06-04 17:43:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839172725] [2024-06-04 17:43:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:43,735 INFO 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 17:43:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839172725] [2024-06-04 17:43:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839172725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289873928] [2024-06-04 17:43:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:43,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:43:43,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 191 transitions, 2209 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 17:43:43,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:43,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:43:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:44,717 INFO L124 PetriNetUnfolderBase]: 2167/3381 cut-off events. [2024-06-04 17:43:44,717 INFO L125 PetriNetUnfolderBase]: For 64708/64711 co-relation queries the response was YES. [2024-06-04 17:43:44,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19502 conditions, 3381 events. 2167/3381 cut-off events. For 64708/64711 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18016 event pairs, 798 based on Foata normal form. 3/3380 useless extension candidates. Maximal degree in co-relation 19438. Up to 3237 conditions per place. [2024-06-04 17:43:44,741 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 177 selfloop transitions, 24 changer transitions 0/205 dead transitions. [2024-06-04 17:43:44,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 205 transitions, 2679 flow [2024-06-04 17:43:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-04 17:43:44,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 17:43:44,743 INFO L175 Difference]: Start difference. First operand has 139 places, 191 transitions, 2209 flow. Second operand 6 states and 96 transitions. [2024-06-04 17:43:44,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 205 transitions, 2679 flow [2024-06-04 17:43:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 205 transitions, 2451 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 17:43:44,801 INFO L231 Difference]: Finished difference. Result has 136 places, 197 transitions, 2102 flow [2024-06-04 17:43:44,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2102, PETRI_PLACES=136, PETRI_TRANSITIONS=197} [2024-06-04 17:43:44,801 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-04 17:43:44,801 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 197 transitions, 2102 flow [2024-06-04 17:43:44,802 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 17:43:44,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:44,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:44,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:43:44,802 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 17:43:44,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -670932906, now seen corresponding path program 1 times [2024-06-04 17:43:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751215278] [2024-06-04 17:43:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:53,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751215278] [2024-06-04 17:43:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751215278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:53,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:53,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:53,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203130501] [2024-06-04 17:43:53,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:53,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:43:53,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 197 transitions, 2102 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 17:43:53,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:53,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:43:53,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:54,236 INFO L124 PetriNetUnfolderBase]: 2103/3319 cut-off events. [2024-06-04 17:43:54,237 INFO L125 PetriNetUnfolderBase]: For 76167/76181 co-relation queries the response was YES. [2024-06-04 17:43:54,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 3319 events. 2103/3319 cut-off events. For 76167/76181 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18131 event pairs, 816 based on Foata normal form. 2/3294 useless extension candidates. Maximal degree in co-relation 19482. Up to 3129 conditions per place. [2024-06-04 17:43:54,258 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 190 selfloop transitions, 12 changer transitions 0/211 dead transitions. [2024-06-04 17:43:54,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 211 transitions, 2566 flow [2024-06-04 17:43:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 17:43:54,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:43:54,259 INFO L175 Difference]: Start difference. First operand has 136 places, 197 transitions, 2102 flow. Second operand 6 states and 102 transitions. [2024-06-04 17:43:54,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 211 transitions, 2566 flow [2024-06-04 17:43:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 211 transitions, 2527 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 17:43:54,337 INFO L231 Difference]: Finished difference. Result has 140 places, 200 transitions, 2123 flow [2024-06-04 17:43:54,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2123, PETRI_PLACES=140, PETRI_TRANSITIONS=200} [2024-06-04 17:43:54,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-04 17:43:54,338 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 200 transitions, 2123 flow [2024-06-04 17:43:54,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 17:43:54,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:54,338 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 17:43:54,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:43:54,338 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:43:54,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1321976462, now seen corresponding path program 1 times [2024-06-04 17:43:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052407203] [2024-06-04 17:43:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:02,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 17:44:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052407203] [2024-06-04 17:44:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052407203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:44:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032381512] [2024-06-04 17:44:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:02,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:44:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:44:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:44:02,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:44:02,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 200 transitions, 2123 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 17:44:02,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:02,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:44:02,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:03,681 INFO L124 PetriNetUnfolderBase]: 2182/3401 cut-off events. [2024-06-04 17:44:03,682 INFO L125 PetriNetUnfolderBase]: For 71920/71920 co-relation queries the response was YES. [2024-06-04 17:44:03,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19873 conditions, 3401 events. 2182/3401 cut-off events. For 71920/71920 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18145 event pairs, 790 based on Foata normal form. 1/3401 useless extension candidates. Maximal degree in co-relation 19805. Up to 3259 conditions per place. [2024-06-04 17:44:03,706 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 190 selfloop transitions, 23 changer transitions 0/217 dead transitions. [2024-06-04 17:44:03,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 217 transitions, 2631 flow [2024-06-04 17:44:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:44:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:44:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-04 17:44:03,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 17:44:03,707 INFO L175 Difference]: Start difference. First operand has 140 places, 200 transitions, 2123 flow. Second operand 7 states and 112 transitions. [2024-06-04 17:44:03,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 217 transitions, 2631 flow [2024-06-04 17:44:03,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 2593 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 17:44:03,781 INFO L231 Difference]: Finished difference. Result has 143 places, 203 transitions, 2182 flow [2024-06-04 17:44:03,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2182, PETRI_PLACES=143, PETRI_TRANSITIONS=203} [2024-06-04 17:44:03,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-04 17:44:03,782 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 203 transitions, 2182 flow [2024-06-04 17:44:03,782 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 17:44:03,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:03,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:03,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:44:03,782 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 17:44:03,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -845915422, now seen corresponding path program 2 times [2024-06-04 17:44:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633154841] [2024-06-04 17:44:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:03,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:12,631 INFO 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 17:44:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633154841] [2024-06-04 17:44:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633154841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:44:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712895917] [2024-06-04 17:44:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:44:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:44:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:44:12,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:44:12,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 203 transitions, 2182 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 17:44:12,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:12,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:44:12,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:13,686 INFO L124 PetriNetUnfolderBase]: 2100/3317 cut-off events. [2024-06-04 17:44:13,686 INFO L125 PetriNetUnfolderBase]: For 85695/85711 co-relation queries the response was YES. [2024-06-04 17:44:13,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20383 conditions, 3317 events. 2100/3317 cut-off events. For 85695/85711 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18129 event pairs, 819 based on Foata normal form. 4/3293 useless extension candidates. Maximal degree in co-relation 20314. Up to 3118 conditions per place. [2024-06-04 17:44:13,711 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 186 selfloop transitions, 19 changer transitions 0/214 dead transitions. [2024-06-04 17:44:13,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 214 transitions, 2648 flow [2024-06-04 17:44:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:44:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:44:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-04 17:44:13,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-04 17:44:13,712 INFO L175 Difference]: Start difference. First operand has 143 places, 203 transitions, 2182 flow. Second operand 6 states and 101 transitions. [2024-06-04 17:44:13,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 214 transitions, 2648 flow [2024-06-04 17:44:13,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 214 transitions, 2575 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:13,834 INFO L231 Difference]: Finished difference. Result has 144 places, 206 transitions, 2192 flow [2024-06-04 17:44:13,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2192, PETRI_PLACES=144, PETRI_TRANSITIONS=206} [2024-06-04 17:44:13,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-04 17:44:13,835 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 206 transitions, 2192 flow [2024-06-04 17:44:13,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 17:44:13,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:13,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:13,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:44:13,835 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 17:44:13,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash -845907486, now seen corresponding path program 1 times [2024-06-04 17:44:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231146906] [2024-06-04 17:44:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:22,869 INFO 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 17:44:22,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231146906] [2024-06-04 17:44:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231146906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:44:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871354426] [2024-06-04 17:44:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:22,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:44:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:44:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:44:22,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:44:22,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 206 transitions, 2192 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 17:44:22,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:22,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:44:22,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:23,943 INFO L124 PetriNetUnfolderBase]: 2173/3391 cut-off events. [2024-06-04 17:44:23,943 INFO L125 PetriNetUnfolderBase]: For 80434/80434 co-relation queries the response was YES. [2024-06-04 17:44:23,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20482 conditions, 3391 events. 2173/3391 cut-off events. For 80434/80434 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18143 event pairs, 879 based on Foata normal form. 1/3391 useless extension candidates. Maximal degree in co-relation 20412. Up to 3273 conditions per place. [2024-06-04 17:44:23,968 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 199 selfloop transitions, 15 changer transitions 0/218 dead transitions. [2024-06-04 17:44:23,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 218 transitions, 2682 flow [2024-06-04 17:44:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:44:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:44:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-04 17:44:23,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693379790940767 [2024-06-04 17:44:23,971 INFO L175 Difference]: Start difference. First operand has 144 places, 206 transitions, 2192 flow. Second operand 7 states and 106 transitions. [2024-06-04 17:44:23,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 218 transitions, 2682 flow [2024-06-04 17:44:24,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 218 transitions, 2623 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 17:44:24,062 INFO L231 Difference]: Finished difference. Result has 147 places, 209 transitions, 2211 flow [2024-06-04 17:44:24,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2211, PETRI_PLACES=147, PETRI_TRANSITIONS=209} [2024-06-04 17:44:24,062 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-04 17:44:24,062 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 209 transitions, 2211 flow [2024-06-04 17:44:24,062 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 17:44:24,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:24,062 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 17:44:24,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:44:24,062 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:44:24,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash -667092773, now seen corresponding path program 1 times [2024-06-04 17:44:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:24,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319133760] [2024-06-04 17:44:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319133760] [2024-06-04 17:44:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319133760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615767361] [2024-06-04 17:44:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:30,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:30,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:44:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 209 transitions, 2211 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 17:44:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:30,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:44:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:31,634 INFO L124 PetriNetUnfolderBase]: 2413/3773 cut-off events. [2024-06-04 17:44:31,634 INFO L125 PetriNetUnfolderBase]: For 100018/100021 co-relation queries the response was YES. [2024-06-04 17:44:31,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22999 conditions, 3773 events. 2413/3773 cut-off events. For 100018/100021 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20772 event pairs, 625 based on Foata normal form. 18/3789 useless extension candidates. Maximal degree in co-relation 22928. Up to 2600 conditions per place. [2024-06-04 17:44:31,660 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 177 selfloop transitions, 83 changer transitions 0/264 dead transitions. [2024-06-04 17:44:31,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 264 transitions, 3088 flow [2024-06-04 17:44:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-04 17:44:31,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-04 17:44:31,662 INFO L175 Difference]: Start difference. First operand has 147 places, 209 transitions, 2211 flow. Second operand 10 states and 183 transitions. [2024-06-04 17:44:31,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 264 transitions, 3088 flow [2024-06-04 17:44:31,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 264 transitions, 3002 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:31,731 INFO L231 Difference]: Finished difference. Result has 152 places, 213 transitions, 2403 flow [2024-06-04 17:44:31,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2403, PETRI_PLACES=152, PETRI_TRANSITIONS=213} [2024-06-04 17:44:31,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-04 17:44:31,732 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 213 transitions, 2403 flow [2024-06-04 17:44:31,732 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 17:44:31,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:31,732 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 17:44:31,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:44:31,733 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:44:31,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -583889393, now seen corresponding path program 2 times [2024-06-04 17:44:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:31,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773626503] [2024-06-04 17:44:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:41,625 INFO 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 17:44:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773626503] [2024-06-04 17:44:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773626503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137174730] [2024-06-04 17:44:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:41,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:44:41,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 213 transitions, 2403 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 17:44:41,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:41,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:44:41,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:43,203 INFO L124 PetriNetUnfolderBase]: 2471/3867 cut-off events. [2024-06-04 17:44:43,203 INFO L125 PetriNetUnfolderBase]: For 107469/107472 co-relation queries the response was YES. [2024-06-04 17:44:43,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24235 conditions, 3867 events. 2471/3867 cut-off events. For 107469/107472 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21344 event pairs, 664 based on Foata normal form. 18/3883 useless extension candidates. Maximal degree in co-relation 24163. Up to 3164 conditions per place. [2024-06-04 17:44:43,229 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 179 selfloop transitions, 81 changer transitions 0/264 dead transitions. [2024-06-04 17:44:43,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 264 transitions, 3129 flow [2024-06-04 17:44:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:44:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:44:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-04 17:44:43,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43680709534368073 [2024-06-04 17:44:43,232 INFO L175 Difference]: Start difference. First operand has 152 places, 213 transitions, 2403 flow. Second operand 11 states and 197 transitions. [2024-06-04 17:44:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 264 transitions, 3129 flow [2024-06-04 17:44:43,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 264 transitions, 3025 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:43,312 INFO L231 Difference]: Finished difference. Result has 157 places, 214 transitions, 2498 flow [2024-06-04 17:44:43,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2299, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2498, PETRI_PLACES=157, PETRI_TRANSITIONS=214} [2024-06-04 17:44:43,312 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-04 17:44:43,313 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 214 transitions, 2498 flow [2024-06-04 17:44:43,313 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 17:44:43,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:43,313 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 17:44:43,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:44:43,313 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:44:43,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 258018413, now seen corresponding path program 3 times [2024-06-04 17:44:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543355210] [2024-06-04 17:44:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:52,174 INFO 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 17:44:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543355210] [2024-06-04 17:44:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543355210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069236339] [2024-06-04 17:44:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:52,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:44:52,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 214 transitions, 2498 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 17:44:52,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:52,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:44:52,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:53,669 INFO L124 PetriNetUnfolderBase]: 2755/4330 cut-off events. [2024-06-04 17:44:53,669 INFO L125 PetriNetUnfolderBase]: For 127038/127041 co-relation queries the response was YES. [2024-06-04 17:44:53,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27502 conditions, 4330 events. 2755/4330 cut-off events. For 127038/127041 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24419 event pairs, 446 based on Foata normal form. 18/4346 useless extension candidates. Maximal degree in co-relation 27428. Up to 3378 conditions per place. [2024-06-04 17:44:53,704 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 179 selfloop transitions, 79 changer transitions 0/262 dead transitions. [2024-06-04 17:44:53,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 262 transitions, 3339 flow [2024-06-04 17:44:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-04 17:44:53,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219512195121951 [2024-06-04 17:44:53,707 INFO L175 Difference]: Start difference. First operand has 157 places, 214 transitions, 2498 flow. Second operand 10 states and 173 transitions. [2024-06-04 17:44:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 262 transitions, 3339 flow [2024-06-04 17:44:53,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 262 transitions, 3144 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:44:53,835 INFO L231 Difference]: Finished difference. Result has 159 places, 220 transitions, 2616 flow [2024-06-04 17:44:53,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2322, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2616, PETRI_PLACES=159, PETRI_TRANSITIONS=220} [2024-06-04 17:44:53,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-04 17:44:53,836 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 220 transitions, 2616 flow [2024-06-04 17:44:53,836 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 17:44:53,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:53,836 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 17:44:53,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:44:53,836 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 17:44:53,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 326730552, now seen corresponding path program 1 times [2024-06-04 17:44:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41290195] [2024-06-04 17:44:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:02,233 INFO 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 17:45:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41290195] [2024-06-04 17:45:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41290195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021352700] [2024-06-04 17:45:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:02,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:45:02,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:45:02,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 220 transitions, 2616 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 17:45:02,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:02,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:45:02,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:03,629 INFO L124 PetriNetUnfolderBase]: 2798/4408 cut-off events. [2024-06-04 17:45:03,629 INFO L125 PetriNetUnfolderBase]: For 127961/127968 co-relation queries the response was YES. [2024-06-04 17:45:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28270 conditions, 4408 events. 2798/4408 cut-off events. For 127961/127968 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25210 event pairs, 948 based on Foata normal form. 8/4414 useless extension candidates. Maximal degree in co-relation 28194. Up to 4108 conditions per place. [2024-06-04 17:45:03,666 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 192 selfloop transitions, 61 changer transitions 0/257 dead transitions. [2024-06-04 17:45:03,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 257 transitions, 3395 flow [2024-06-04 17:45:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 17:45:03,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 17:45:03,667 INFO L175 Difference]: Start difference. First operand has 159 places, 220 transitions, 2616 flow. Second operand 8 states and 140 transitions. [2024-06-04 17:45:03,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 257 transitions, 3395 flow [2024-06-04 17:45:03,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 257 transitions, 3268 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:03,793 INFO L231 Difference]: Finished difference. Result has 162 places, 234 transitions, 2852 flow [2024-06-04 17:45:03,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2852, PETRI_PLACES=162, PETRI_TRANSITIONS=234} [2024-06-04 17:45:03,793 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-04 17:45:03,793 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 234 transitions, 2852 flow [2024-06-04 17:45:03,793 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 17:45:03,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:03,794 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 17:45:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:45:03,794 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:45:03,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -167018621, now seen corresponding path program 4 times [2024-06-04 17:45:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961389288] [2024-06-04 17:45:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:14,088 INFO 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 17:45:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961389288] [2024-06-04 17:45:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961389288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549989617] [2024-06-04 17:45:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:14,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:14,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:45:14,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 234 transitions, 2852 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 17:45:14,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:14,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:45:14,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:15,763 INFO L124 PetriNetUnfolderBase]: 3067/4857 cut-off events. [2024-06-04 17:45:15,764 INFO L125 PetriNetUnfolderBase]: For 152107/152111 co-relation queries the response was YES. [2024-06-04 17:45:15,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31858 conditions, 4857 events. 3067/4857 cut-off events. For 152107/152111 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 28524 event pairs, 1151 based on Foata normal form. 28/4884 useless extension candidates. Maximal degree in co-relation 31779. Up to 4100 conditions per place. [2024-06-04 17:45:15,802 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 249 selfloop transitions, 60 changer transitions 0/313 dead transitions. [2024-06-04 17:45:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 313 transitions, 4302 flow [2024-06-04 17:45:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-04 17:45:15,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-04 17:45:15,804 INFO L175 Difference]: Start difference. First operand has 162 places, 234 transitions, 2852 flow. Second operand 10 states and 182 transitions. [2024-06-04 17:45:15,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 313 transitions, 4302 flow [2024-06-04 17:45:15,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 313 transitions, 4127 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:15,963 INFO L231 Difference]: Finished difference. Result has 170 places, 262 transitions, 3403 flow [2024-06-04 17:45:15,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2700, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3403, PETRI_PLACES=170, PETRI_TRANSITIONS=262} [2024-06-04 17:45:15,963 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places. [2024-06-04 17:45:15,963 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 262 transitions, 3403 flow [2024-06-04 17:45:15,964 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 17:45:15,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:15,964 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 17:45:15,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:45:15,964 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:45:15,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2091851361, now seen corresponding path program 5 times [2024-06-04 17:45:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495814023] [2024-06-04 17:45:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:25,789 INFO 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 17:45:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495814023] [2024-06-04 17:45:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495814023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242525802] [2024-06-04 17:45:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:25,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:25,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:45:25,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 262 transitions, 3403 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 17:45:25,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:25,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:45:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:27,563 INFO L124 PetriNetUnfolderBase]: 3191/5055 cut-off events. [2024-06-04 17:45:27,563 INFO L125 PetriNetUnfolderBase]: For 169075/169078 co-relation queries the response was YES. [2024-06-04 17:45:27,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33766 conditions, 5055 events. 3191/5055 cut-off events. For 169075/169078 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29959 event pairs, 955 based on Foata normal form. 32/5085 useless extension candidates. Maximal degree in co-relation 33683. Up to 4324 conditions per place. [2024-06-04 17:45:27,682 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 200 selfloop transitions, 97 changer transitions 0/301 dead transitions. [2024-06-04 17:45:27,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 301 transitions, 4211 flow [2024-06-04 17:45:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-04 17:45:27,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-04 17:45:27,686 INFO L175 Difference]: Start difference. First operand has 170 places, 262 transitions, 3403 flow. Second operand 9 states and 161 transitions. [2024-06-04 17:45:27,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 301 transitions, 4211 flow [2024-06-04 17:45:27,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 301 transitions, 4148 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:27,857 INFO L231 Difference]: Finished difference. Result has 175 places, 264 transitions, 3617 flow [2024-06-04 17:45:27,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3617, PETRI_PLACES=175, PETRI_TRANSITIONS=264} [2024-06-04 17:45:27,857 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places. [2024-06-04 17:45:27,857 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 264 transitions, 3617 flow [2024-06-04 17:45:27,857 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 17:45:27,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:27,858 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 17:45:27,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:45:27,858 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:45:27,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash -166870751, now seen corresponding path program 6 times [2024-06-04 17:45:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079681132] [2024-06-04 17:45:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:38,241 INFO 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 17:45:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079681132] [2024-06-04 17:45:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079681132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:38,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538612821] [2024-06-04 17:45:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:38,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:38,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:38,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:45:38,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 264 transitions, 3617 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 17:45:38,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:38,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:45:38,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:40,072 INFO L124 PetriNetUnfolderBase]: 3218/5103 cut-off events. [2024-06-04 17:45:40,072 INFO L125 PetriNetUnfolderBase]: For 169019/169028 co-relation queries the response was YES. [2024-06-04 17:45:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33970 conditions, 5103 events. 3218/5103 cut-off events. For 169019/169028 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30383 event pairs, 929 based on Foata normal form. 38/5139 useless extension candidates. Maximal degree in co-relation 33885. Up to 4360 conditions per place. [2024-06-04 17:45:40,119 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 202 selfloop transitions, 108 changer transitions 0/314 dead transitions. [2024-06-04 17:45:40,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 314 transitions, 4502 flow [2024-06-04 17:45:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-04 17:45:40,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43015521064301554 [2024-06-04 17:45:40,121 INFO L175 Difference]: Start difference. First operand has 175 places, 264 transitions, 3617 flow. Second operand 11 states and 194 transitions. [2024-06-04 17:45:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 314 transitions, 4502 flow [2024-06-04 17:45:40,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 314 transitions, 4262 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:40,316 INFO L231 Difference]: Finished difference. Result has 180 places, 270 transitions, 3753 flow [2024-06-04 17:45:40,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3753, PETRI_PLACES=180, PETRI_TRANSITIONS=270} [2024-06-04 17:45:40,317 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-04 17:45:40,317 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 270 transitions, 3753 flow [2024-06-04 17:45:40,317 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 17:45:40,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:40,317 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 17:45:40,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:45:40,318 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:45:40,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -161293169, now seen corresponding path program 1 times [2024-06-04 17:45:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127400628] [2024-06-04 17:45:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:49,644 INFO 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 17:45:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127400628] [2024-06-04 17:45:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127400628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:49,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581088431] [2024-06-04 17:45:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:49,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:49,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:45:49,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 270 transitions, 3753 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:45:49,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:49,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:45:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:51,453 INFO L124 PetriNetUnfolderBase]: 3294/5218 cut-off events. [2024-06-04 17:45:51,453 INFO L125 PetriNetUnfolderBase]: For 168430/168433 co-relation queries the response was YES. [2024-06-04 17:45:51,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35006 conditions, 5218 events. 3294/5218 cut-off events. For 168430/168433 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30969 event pairs, 935 based on Foata normal form. 14/5230 useless extension candidates. Maximal degree in co-relation 34919. Up to 3849 conditions per place. [2024-06-04 17:45:51,510 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 202 selfloop transitions, 106 changer transitions 0/312 dead transitions. [2024-06-04 17:45:51,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 312 transitions, 4669 flow [2024-06-04 17:45:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-04 17:45:51,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-04 17:45:51,513 INFO L175 Difference]: Start difference. First operand has 180 places, 270 transitions, 3753 flow. Second operand 9 states and 163 transitions. [2024-06-04 17:45:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 312 transitions, 4669 flow [2024-06-04 17:45:51,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 312 transitions, 4479 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:51,713 INFO L231 Difference]: Finished difference. Result has 184 places, 274 transitions, 3911 flow [2024-06-04 17:45:51,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3563, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3911, PETRI_PLACES=184, PETRI_TRANSITIONS=274} [2024-06-04 17:45:51,714 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-04 17:45:51,714 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 274 transitions, 3911 flow [2024-06-04 17:45:51,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:45:51,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:51,714 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 17:45:51,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:45:51,715 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 17:45:51,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1797034278, now seen corresponding path program 2 times [2024-06-04 17:45:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735729448] [2024-06-04 17:45:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:51,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:59,934 INFO 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 17:45:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735729448] [2024-06-04 17:45:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735729448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:59,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349272283] [2024-06-04 17:45:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:59,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:59,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:46:00,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:00,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 274 transitions, 3911 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 17:46:00,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:00,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:00,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:01,618 INFO L124 PetriNetUnfolderBase]: 3314/5253 cut-off events. [2024-06-04 17:46:01,618 INFO L125 PetriNetUnfolderBase]: For 169748/169757 co-relation queries the response was YES. [2024-06-04 17:46:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35440 conditions, 5253 events. 3314/5253 cut-off events. For 169748/169757 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31416 event pairs, 975 based on Foata normal form. 10/5261 useless extension candidates. Maximal degree in co-relation 35351. Up to 4907 conditions per place. [2024-06-04 17:46:01,663 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 227 selfloop transitions, 72 changer transitions 0/303 dead transitions. [2024-06-04 17:46:01,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 303 transitions, 4647 flow [2024-06-04 17:46:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-04 17:46:01,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-04 17:46:01,665 INFO L175 Difference]: Start difference. First operand has 184 places, 274 transitions, 3911 flow. Second operand 8 states and 139 transitions. [2024-06-04 17:46:01,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 303 transitions, 4647 flow [2024-06-04 17:46:01,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 303 transitions, 4504 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-04 17:46:01,887 INFO L231 Difference]: Finished difference. Result has 187 places, 282 transitions, 4010 flow [2024-06-04 17:46:01,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3768, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4010, PETRI_PLACES=187, PETRI_TRANSITIONS=282} [2024-06-04 17:46:01,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-04 17:46:01,888 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 282 transitions, 4010 flow [2024-06-04 17:46:01,888 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 17:46:01,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:01,889 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 17:46:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:46:01,889 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 17:46:01,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2001614338, now seen corresponding path program 3 times [2024-06-04 17:46:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299272648] [2024-06-04 17:46:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:10,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 17:46:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299272648] [2024-06-04 17:46:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299272648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:46:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712209077] [2024-06-04 17:46:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:46:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:10,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:46:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:46:10,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:10,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 282 transitions, 4010 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 17:46:10,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:10,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:11,891 INFO L124 PetriNetUnfolderBase]: 3342/5290 cut-off events. [2024-06-04 17:46:11,891 INFO L125 PetriNetUnfolderBase]: For 173795/173798 co-relation queries the response was YES. [2024-06-04 17:46:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36382 conditions, 5290 events. 3342/5290 cut-off events. For 173795/173798 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 31473 event pairs, 986 based on Foata normal form. 4/5292 useless extension candidates. Maximal degree in co-relation 36291. Up to 4894 conditions per place. [2024-06-04 17:46:11,943 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 230 selfloop transitions, 75 changer transitions 0/309 dead transitions. [2024-06-04 17:46:11,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 309 transitions, 4874 flow [2024-06-04 17:46:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 17:46:11,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-04 17:46:11,945 INFO L175 Difference]: Start difference. First operand has 187 places, 282 transitions, 4010 flow. Second operand 8 states and 137 transitions. [2024-06-04 17:46:11,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 309 transitions, 4874 flow [2024-06-04 17:46:12,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 309 transitions, 4706 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:12,211 INFO L231 Difference]: Finished difference. Result has 190 places, 290 transitions, 4154 flow [2024-06-04 17:46:12,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3842, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4154, PETRI_PLACES=190, PETRI_TRANSITIONS=290} [2024-06-04 17:46:12,211 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2024-06-04 17:46:12,212 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 290 transitions, 4154 flow [2024-06-04 17:46:12,212 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 17:46:12,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:12,212 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 17:46:12,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:46:12,212 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:46:12,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -731065153, now seen corresponding path program 7 times [2024-06-04 17:46:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:12,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469801507] [2024-06-04 17:46:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:22,381 INFO 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 17:46:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469801507] [2024-06-04 17:46:22,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469801507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:22,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173014706] [2024-06-04 17:46:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:22,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:22,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:22,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 290 transitions, 4154 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 17:46:22,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:22,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:22,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:24,336 INFO L124 PetriNetUnfolderBase]: 3476/5506 cut-off events. [2024-06-04 17:46:24,336 INFO L125 PetriNetUnfolderBase]: For 209333/209339 co-relation queries the response was YES. [2024-06-04 17:46:24,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38338 conditions, 5506 events. 3476/5506 cut-off events. For 209333/209339 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32955 event pairs, 906 based on Foata normal form. 38/5543 useless extension candidates. Maximal degree in co-relation 38245. Up to 3983 conditions per place. [2024-06-04 17:46:24,389 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 198 selfloop transitions, 139 changer transitions 0/341 dead transitions. [2024-06-04 17:46:24,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 341 transitions, 5110 flow [2024-06-04 17:46:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-04 17:46:24,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-04 17:46:24,391 INFO L175 Difference]: Start difference. First operand has 190 places, 290 transitions, 4154 flow. Second operand 10 states and 183 transitions. [2024-06-04 17:46:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 341 transitions, 5110 flow [2024-06-04 17:46:24,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 341 transitions, 4981 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-04 17:46:24,686 INFO L231 Difference]: Finished difference. Result has 196 places, 293 transitions, 4416 flow [2024-06-04 17:46:24,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4416, PETRI_PLACES=196, PETRI_TRANSITIONS=293} [2024-06-04 17:46:24,687 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-04 17:46:24,687 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 293 transitions, 4416 flow [2024-06-04 17:46:24,687 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 17:46:24,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:24,688 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 17:46:24,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:46:24,688 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:46:24,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 39838263, now seen corresponding path program 8 times [2024-06-04 17:46:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714324865] [2024-06-04 17:46:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714324865] [2024-06-04 17:46:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714324865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:35,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:35,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369620324] [2024-06-04 17:46:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:35,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:35,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:35,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:35,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 293 transitions, 4416 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 17:46:35,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:35,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:35,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:37,562 INFO L124 PetriNetUnfolderBase]: 3633/5785 cut-off events. [2024-06-04 17:46:37,562 INFO L125 PetriNetUnfolderBase]: For 226563/226569 co-relation queries the response was YES. [2024-06-04 17:46:37,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41226 conditions, 5785 events. 3633/5785 cut-off events. For 226563/226569 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35236 event pairs, 718 based on Foata normal form. 30/5814 useless extension candidates. Maximal degree in co-relation 41131. Up to 2388 conditions per place. [2024-06-04 17:46:37,612 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 181 selfloop transitions, 160 changer transitions 0/345 dead transitions. [2024-06-04 17:46:37,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 345 transitions, 5509 flow [2024-06-04 17:46:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-04 17:46:37,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-04 17:46:37,615 INFO L175 Difference]: Start difference. First operand has 196 places, 293 transitions, 4416 flow. Second operand 10 states and 183 transitions. [2024-06-04 17:46:37,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 345 transitions, 5509 flow [2024-06-04 17:46:37,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 345 transitions, 5186 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:37,948 INFO L231 Difference]: Finished difference. Result has 198 places, 296 transitions, 4516 flow [2024-06-04 17:46:37,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4093, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4516, PETRI_PLACES=198, PETRI_TRANSITIONS=296} [2024-06-04 17:46:37,948 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-06-04 17:46:37,948 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 296 transitions, 4516 flow [2024-06-04 17:46:37,948 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 17:46:37,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:37,949 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 17:46:37,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:46:37,949 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 17:46:37,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -808319374, now seen corresponding path program 4 times [2024-06-04 17:46:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34802862] [2024-06-04 17:46:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:46,516 INFO 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 17:46:46,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34802862] [2024-06-04 17:46:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34802862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:46:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243242616] [2024-06-04 17:46:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:46:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:46:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:46:46,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:46,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 296 transitions, 4516 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 17:46:46,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:46,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:46,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:48,308 INFO L124 PetriNetUnfolderBase]: 3643/5807 cut-off events. [2024-06-04 17:46:48,308 INFO L125 PetriNetUnfolderBase]: For 217940/217949 co-relation queries the response was YES. [2024-06-04 17:46:48,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41623 conditions, 5807 events. 3643/5807 cut-off events. For 217940/217949 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 35678 event pairs, 1191 based on Foata normal form. 10/5815 useless extension candidates. Maximal degree in co-relation 41527. Up to 5431 conditions per place. [2024-06-04 17:46:48,371 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 81 changer transitions 0/319 dead transitions. [2024-06-04 17:46:48,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 319 transitions, 5282 flow [2024-06-04 17:46:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:46:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:46:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 17:46:48,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:46:48,372 INFO L175 Difference]: Start difference. First operand has 198 places, 296 transitions, 4516 flow. Second operand 7 states and 123 transitions. [2024-06-04 17:46:48,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 319 transitions, 5282 flow [2024-06-04 17:46:48,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 319 transitions, 5095 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:48,806 INFO L231 Difference]: Finished difference. Result has 197 places, 300 transitions, 4592 flow [2024-06-04 17:46:48,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4329, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4592, PETRI_PLACES=197, PETRI_TRANSITIONS=300} [2024-06-04 17:46:48,807 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-04 17:46:48,807 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 300 transitions, 4592 flow [2024-06-04 17:46:48,807 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 17:46:48,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:48,807 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 17:46:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:46:48,808 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:46:48,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 648490923, now seen corresponding path program 9 times [2024-06-04 17:46:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981949157] [2024-06-04 17:46:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:59,089 INFO 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 17:46:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981949157] [2024-06-04 17:46:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981949157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143374985] [2024-06-04 17:46:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:59,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:59,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:59,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:46:59,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 300 transitions, 4592 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 17:46:59,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:59,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:46:59,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:01,281 INFO L124 PetriNetUnfolderBase]: 3726/5955 cut-off events. [2024-06-04 17:47:01,282 INFO L125 PetriNetUnfolderBase]: For 224919/224925 co-relation queries the response was YES. [2024-06-04 17:47:01,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42169 conditions, 5955 events. 3726/5955 cut-off events. For 224919/224925 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 36758 event pairs, 753 based on Foata normal form. 38/5992 useless extension candidates. Maximal degree in co-relation 42073. Up to 4020 conditions per place. [2024-06-04 17:47:01,338 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 198 selfloop transitions, 149 changer transitions 0/351 dead transitions. [2024-06-04 17:47:01,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 351 transitions, 5676 flow [2024-06-04 17:47:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-04 17:47:01,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-04 17:47:01,341 INFO L175 Difference]: Start difference. First operand has 197 places, 300 transitions, 4592 flow. Second operand 10 states and 184 transitions. [2024-06-04 17:47:01,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 351 transitions, 5676 flow [2024-06-04 17:47:01,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 351 transitions, 5487 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:01,727 INFO L231 Difference]: Finished difference. Result has 202 places, 302 transitions, 4781 flow [2024-06-04 17:47:01,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4403, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4781, PETRI_PLACES=202, PETRI_TRANSITIONS=302} [2024-06-04 17:47:01,728 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-04 17:47:01,728 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 302 transitions, 4781 flow [2024-06-04 17:47:01,728 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 17:47:01,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:01,728 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 17:47:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:47:01,728 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:47:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 654001173, now seen corresponding path program 10 times [2024-06-04 17:47:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729145005] [2024-06-04 17:47:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:09,496 INFO 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 17:47:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729145005] [2024-06-04 17:47:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729145005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:09,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:09,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69896957] [2024-06-04 17:47:09,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:09,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:09,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:47:09,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 302 transitions, 4781 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 17:47:09,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:09,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:47:09,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:11,688 INFO L124 PetriNetUnfolderBase]: 3801/6088 cut-off events. [2024-06-04 17:47:11,688 INFO L125 PetriNetUnfolderBase]: For 228783/228783 co-relation queries the response was YES. [2024-06-04 17:47:11,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43697 conditions, 6088 events. 3801/6088 cut-off events. For 228783/228783 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 37828 event pairs, 1021 based on Foata normal form. 20/6104 useless extension candidates. Maximal degree in co-relation 43600. Up to 5031 conditions per place. [2024-06-04 17:47:11,742 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 216 selfloop transitions, 116 changer transitions 0/336 dead transitions. [2024-06-04 17:47:11,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 336 transitions, 5605 flow [2024-06-04 17:47:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 17:47:11,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 17:47:11,744 INFO L175 Difference]: Start difference. First operand has 202 places, 302 transitions, 4781 flow. Second operand 8 states and 147 transitions. [2024-06-04 17:47:11,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 336 transitions, 5605 flow [2024-06-04 17:47:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 336 transitions, 5329 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:12,113 INFO L231 Difference]: Finished difference. Result has 202 places, 303 transitions, 4788 flow [2024-06-04 17:47:12,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4507, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4788, PETRI_PLACES=202, PETRI_TRANSITIONS=303} [2024-06-04 17:47:12,114 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-04 17:47:12,114 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 303 transitions, 4788 flow [2024-06-04 17:47:12,114 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 17:47:12,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:12,114 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 17:47:12,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:47:12,114 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:47:12,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1574659087, now seen corresponding path program 11 times [2024-06-04 17:47:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742572] [2024-06-04 17:47:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:21,934 INFO 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 17:47:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742572] [2024-06-04 17:47:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367695312] [2024-06-04 17:47:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:21,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:22,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:47:22,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 303 transitions, 4788 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 17:47:22,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:22,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:47:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:24,214 INFO L124 PetriNetUnfolderBase]: 3853/6185 cut-off events. [2024-06-04 17:47:24,214 INFO L125 PetriNetUnfolderBase]: For 226587/226596 co-relation queries the response was YES. [2024-06-04 17:47:24,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43394 conditions, 6185 events. 3853/6185 cut-off events. For 226587/226596 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 38814 event pairs, 1070 based on Foata normal form. 38/6221 useless extension candidates. Maximal degree in co-relation 43297. Up to 5055 conditions per place. [2024-06-04 17:47:24,266 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 214 selfloop transitions, 133 changer transitions 0/351 dead transitions. [2024-06-04 17:47:24,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 351 transitions, 5696 flow [2024-06-04 17:47:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-04 17:47:24,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43015521064301554 [2024-06-04 17:47:24,268 INFO L175 Difference]: Start difference. First operand has 202 places, 303 transitions, 4788 flow. Second operand 11 states and 194 transitions. [2024-06-04 17:47:24,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 351 transitions, 5696 flow [2024-06-04 17:47:24,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 351 transitions, 5445 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:47:24,618 INFO L231 Difference]: Finished difference. Result has 207 places, 304 transitions, 4857 flow [2024-06-04 17:47:24,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4857, PETRI_PLACES=207, PETRI_TRANSITIONS=304} [2024-06-04 17:47:24,618 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-04 17:47:24,619 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 304 transitions, 4857 flow [2024-06-04 17:47:24,619 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 17:47:24,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:24,619 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 17:47:24,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:47:24,619 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:47:24,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1580236669, now seen corresponding path program 2 times [2024-06-04 17:47:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383429352] [2024-06-04 17:47:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383429352] [2024-06-04 17:47:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383429352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814456138] [2024-06-04 17:47:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:31,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:31,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:47:31,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 304 transitions, 4857 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:47:31,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:31,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:47:31,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:33,617 INFO L124 PetriNetUnfolderBase]: 3894/6261 cut-off events. [2024-06-04 17:47:33,617 INFO L125 PetriNetUnfolderBase]: For 220078/220078 co-relation queries the response was YES. [2024-06-04 17:47:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43972 conditions, 6261 events. 3894/6261 cut-off events. For 220078/220078 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 39277 event pairs, 1019 based on Foata normal form. 12/6269 useless extension candidates. Maximal degree in co-relation 43874. Up to 4231 conditions per place. [2024-06-04 17:47:33,687 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 210 selfloop transitions, 126 changer transitions 0/340 dead transitions. [2024-06-04 17:47:33,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 340 transitions, 5705 flow [2024-06-04 17:47:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-04 17:47:33,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-04 17:47:33,690 INFO L175 Difference]: Start difference. First operand has 207 places, 304 transitions, 4857 flow. Second operand 8 states and 148 transitions. [2024-06-04 17:47:33,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 340 transitions, 5705 flow [2024-06-04 17:47:34,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 340 transitions, 5421 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:34,106 INFO L231 Difference]: Finished difference. Result has 206 places, 305 transitions, 4872 flow [2024-06-04 17:47:34,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4573, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4872, PETRI_PLACES=206, PETRI_TRANSITIONS=305} [2024-06-04 17:47:34,107 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-04 17:47:34,107 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 305 transitions, 4872 flow [2024-06-04 17:47:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:47:34,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:34,107 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 17:47:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:47:34,107 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 17:47:34,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1321976090, now seen corresponding path program 5 times [2024-06-04 17:47:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:34,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917141894] [2024-06-04 17:47:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:43,035 INFO 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 17:47:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917141894] [2024-06-04 17:47:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917141894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:47:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039057250] [2024-06-04 17:47:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:43,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:47:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:43,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:47:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:47:43,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:47:43,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 305 transitions, 4872 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 17:47:43,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:43,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:47:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:44,940 INFO L124 PetriNetUnfolderBase]: 3922/6304 cut-off events. [2024-06-04 17:47:44,940 INFO L125 PetriNetUnfolderBase]: For 206852/206855 co-relation queries the response was YES. [2024-06-04 17:47:44,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44134 conditions, 6304 events. 3922/6304 cut-off events. For 206852/206855 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39974 event pairs, 1197 based on Foata normal form. 4/6306 useless extension candidates. Maximal degree in co-relation 44035. Up to 5837 conditions per place. [2024-06-04 17:47:45,004 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 241 selfloop transitions, 83 changer transitions 0/328 dead transitions. [2024-06-04 17:47:45,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 328 transitions, 5798 flow [2024-06-04 17:47:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:47:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:47:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 17:47:45,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:47:45,005 INFO L175 Difference]: Start difference. First operand has 206 places, 305 transitions, 4872 flow. Second operand 7 states and 119 transitions. [2024-06-04 17:47:45,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 328 transitions, 5798 flow [2024-06-04 17:47:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 328 transitions, 5505 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:45,365 INFO L231 Difference]: Finished difference. Result has 206 places, 313 transitions, 4961 flow [2024-06-04 17:47:45,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4583, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4961, PETRI_PLACES=206, PETRI_TRANSITIONS=313} [2024-06-04 17:47:45,365 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-04 17:47:45,365 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 313 transitions, 4961 flow [2024-06-04 17:47:45,365 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 17:47:45,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:45,365 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 17:47:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:47:45,366 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:47:45,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1697555709, now seen corresponding path program 12 times [2024-06-04 17:47:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637264221] [2024-06-04 17:47:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:53,079 INFO 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 17:47:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:53,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637264221] [2024-06-04 17:47:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637264221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193430925] [2024-06-04 17:47:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:53,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:53,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:47:53,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 313 transitions, 4961 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 17:47:53,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:53,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:47:53,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:55,221 INFO L124 PetriNetUnfolderBase]: 3886/6251 cut-off events. [2024-06-04 17:47:55,222 INFO L125 PetriNetUnfolderBase]: For 196137/196140 co-relation queries the response was YES. [2024-06-04 17:47:55,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42906 conditions, 6251 events. 3886/6251 cut-off events. For 196137/196140 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 39451 event pairs, 1050 based on Foata normal form. 22/6252 useless extension candidates. Maximal degree in co-relation 42807. Up to 5374 conditions per place. [2024-06-04 17:47:55,282 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 232 selfloop transitions, 107 changer transitions 0/343 dead transitions. [2024-06-04 17:47:55,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 343 transitions, 5759 flow [2024-06-04 17:47:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:47:55,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 17:47:55,285 INFO L175 Difference]: Start difference. First operand has 206 places, 313 transitions, 4961 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:47:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 343 transitions, 5759 flow [2024-06-04 17:47:55,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 343 transitions, 5608 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-04 17:47:55,648 INFO L231 Difference]: Finished difference. Result has 211 places, 313 transitions, 5033 flow [2024-06-04 17:47:55,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4812, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5033, PETRI_PLACES=211, PETRI_TRANSITIONS=313} [2024-06-04 17:47:55,648 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-06-04 17:47:55,648 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 313 transitions, 5033 flow [2024-06-04 17:47:55,648 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 17:47:55,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:55,649 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 17:47:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:47:55,649 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:47:55,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1747692385, now seen corresponding path program 3 times [2024-06-04 17:47:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32058553] [2024-06-04 17:47:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32058553] [2024-06-04 17:48:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32058553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138140587] [2024-06-04 17:48:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:03,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:03,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:48:03,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 313 transitions, 5033 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:48:03,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:03,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:48:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:05,767 INFO L124 PetriNetUnfolderBase]: 3866/6219 cut-off events. [2024-06-04 17:48:05,767 INFO L125 PetriNetUnfolderBase]: For 179724/179727 co-relation queries the response was YES. [2024-06-04 17:48:05,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42106 conditions, 6219 events. 3866/6219 cut-off events. For 179724/179727 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 39252 event pairs, 1021 based on Foata normal form. 14/6212 useless extension candidates. Maximal degree in co-relation 42005. Up to 5255 conditions per place. [2024-06-04 17:48:05,827 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 232 selfloop transitions, 109 changer transitions 0/345 dead transitions. [2024-06-04 17:48:05,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 345 transitions, 5849 flow [2024-06-04 17:48:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:48:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:48:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 17:48:05,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 17:48:05,829 INFO L175 Difference]: Start difference. First operand has 211 places, 313 transitions, 5033 flow. Second operand 8 states and 144 transitions. [2024-06-04 17:48:05,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 345 transitions, 5849 flow [2024-06-04 17:48:06,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 345 transitions, 5567 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:06,168 INFO L231 Difference]: Finished difference. Result has 212 places, 313 transitions, 4975 flow [2024-06-04 17:48:06,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4975, PETRI_PLACES=212, PETRI_TRANSITIONS=313} [2024-06-04 17:48:06,169 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-04 17:48:06,169 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 313 transitions, 4975 flow [2024-06-04 17:48:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:48:06,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:06,169 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 17:48:06,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:48:06,169 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:48:06,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1689931197, now seen corresponding path program 4 times [2024-06-04 17:48:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627560455] [2024-06-04 17:48:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:14,387 INFO 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 17:48:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627560455] [2024-06-04 17:48:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627560455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074401664] [2024-06-04 17:48:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:14,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:48:14,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 313 transitions, 4975 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:48:14,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:14,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:48:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:16,484 INFO L124 PetriNetUnfolderBase]: 3846/6187 cut-off events. [2024-06-04 17:48:16,484 INFO L125 PetriNetUnfolderBase]: For 175616/175619 co-relation queries the response was YES. [2024-06-04 17:48:16,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41379 conditions, 6187 events. 3846/6187 cut-off events. For 175616/175619 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 38803 event pairs, 967 based on Foata normal form. 14/6180 useless extension candidates. Maximal degree in co-relation 41277. Up to 3833 conditions per place. [2024-06-04 17:48:16,548 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 214 selfloop transitions, 126 changer transitions 0/344 dead transitions. [2024-06-04 17:48:16,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 344 transitions, 5725 flow [2024-06-04 17:48:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:48:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:48:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:48:16,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 17:48:16,550 INFO L175 Difference]: Start difference. First operand has 212 places, 313 transitions, 4975 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:48:16,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 344 transitions, 5725 flow [2024-06-04 17:48:16,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 344 transitions, 5305 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:16,866 INFO L231 Difference]: Finished difference. Result has 211 places, 312 transitions, 4747 flow [2024-06-04 17:48:16,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4491, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4747, PETRI_PLACES=211, PETRI_TRANSITIONS=312} [2024-06-04 17:48:16,866 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-06-04 17:48:16,866 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 312 transitions, 4747 flow [2024-06-04 17:48:16,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 17:48:16,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:16,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:16,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:48:16,867 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 17:48:16,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -453757804, now seen corresponding path program 6 times [2024-06-04 17:48:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464410955] [2024-06-04 17:48:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:25,281 INFO 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 17:48:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:25,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464410955] [2024-06-04 17:48:25,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464410955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:25,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:25,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:48:25,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065295422] [2024-06-04 17:48:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:25,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:48:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:48:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:48:25,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:48:25,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 312 transitions, 4747 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 17:48:25,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:25,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:48:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:27,058 INFO L124 PetriNetUnfolderBase]: 3850/6194 cut-off events. [2024-06-04 17:48:27,058 INFO L125 PetriNetUnfolderBase]: For 171817/171820 co-relation queries the response was YES. [2024-06-04 17:48:27,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40773 conditions, 6194 events. 3850/6194 cut-off events. For 171817/171820 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 39134 event pairs, 1168 based on Foata normal form. 4/6177 useless extension candidates. Maximal degree in co-relation 40671. Up to 5692 conditions per place. [2024-06-04 17:48:27,118 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 241 selfloop transitions, 91 changer transitions 0/336 dead transitions. [2024-06-04 17:48:27,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 336 transitions, 5789 flow [2024-06-04 17:48:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:48:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:48:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 17:48:27,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-04 17:48:27,119 INFO L175 Difference]: Start difference. First operand has 211 places, 312 transitions, 4747 flow. Second operand 7 states and 116 transitions. [2024-06-04 17:48:27,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 336 transitions, 5789 flow [2024-06-04 17:48:27,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 336 transitions, 5424 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:27,450 INFO L231 Difference]: Finished difference. Result has 213 places, 325 transitions, 4827 flow [2024-06-04 17:48:27,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4382, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4827, PETRI_PLACES=213, PETRI_TRANSITIONS=325} [2024-06-04 17:48:27,451 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2024-06-04 17:48:27,451 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 325 transitions, 4827 flow [2024-06-04 17:48:27,451 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 17:48:27,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:27,451 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 17:48:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:48:27,451 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 17:48:27,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -453757432, now seen corresponding path program 2 times [2024-06-04 17:48:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:27,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622843796] [2024-06-04 17:48:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:35,834 INFO 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 17:48:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622843796] [2024-06-04 17:48:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622843796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:35,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:35,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:48:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345137055] [2024-06-04 17:48:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:35,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:48:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:48:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:48:35,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:48:35,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 325 transitions, 4827 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 17:48:35,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:35,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:48:35,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:37,549 INFO L124 PetriNetUnfolderBase]: 3855/6208 cut-off events. [2024-06-04 17:48:37,549 INFO L125 PetriNetUnfolderBase]: For 178788/178800 co-relation queries the response was YES. [2024-06-04 17:48:37,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40259 conditions, 6208 events. 3855/6208 cut-off events. For 178788/178800 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 39284 event pairs, 1511 based on Foata normal form. 9/6213 useless extension candidates. Maximal degree in co-relation 40155. Up to 5970 conditions per place. [2024-06-04 17:48:37,615 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 304 selfloop transitions, 33 changer transitions 0/341 dead transitions. [2024-06-04 17:48:37,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 341 transitions, 5743 flow [2024-06-04 17:48:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:48:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:48:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-04 17:48:37,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3832752613240418 [2024-06-04 17:48:37,616 INFO L175 Difference]: Start difference. First operand has 213 places, 325 transitions, 4827 flow. Second operand 7 states and 110 transitions. [2024-06-04 17:48:37,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 341 transitions, 5743 flow [2024-06-04 17:48:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 341 transitions, 5600 flow, removed 47 selfloop flow, removed 2 redundant places. [2024-06-04 17:48:37,930 INFO L231 Difference]: Finished difference. Result has 218 places, 331 transitions, 4886 flow [2024-06-04 17:48:37,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4684, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4886, PETRI_PLACES=218, PETRI_TRANSITIONS=331} [2024-06-04 17:48:37,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places. [2024-06-04 17:48:37,931 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 331 transitions, 4886 flow [2024-06-04 17:48:37,931 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 17:48:37,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:37,931 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 17:48:37,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:48:37,931 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 17:48:37,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -453341722, now seen corresponding path program 3 times [2024-06-04 17:48:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253217992] [2024-06-04 17:48:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253217992] [2024-06-04 17:48:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253217992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:46,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:48:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519828600] [2024-06-04 17:48:46,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:46,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:48:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:46,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:48:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:48:46,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:48:46,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 331 transitions, 4886 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 17:48:46,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:46,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:48:46,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:48,704 INFO L124 PetriNetUnfolderBase]: 3852/6207 cut-off events. [2024-06-04 17:48:48,704 INFO L125 PetriNetUnfolderBase]: For 183005/183005 co-relation queries the response was YES. [2024-06-04 17:48:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40063 conditions, 6207 events. 3852/6207 cut-off events. For 183005/183005 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 39411 event pairs, 1769 based on Foata normal form. 1/6207 useless extension candidates. Maximal degree in co-relation 39957. Up to 6008 conditions per place. [2024-06-04 17:48:48,766 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 321 selfloop transitions, 15 changer transitions 0/340 dead transitions. [2024-06-04 17:48:48,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 340 transitions, 5586 flow [2024-06-04 17:48:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:48:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:48:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-04 17:48:48,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-04 17:48:48,767 INFO L175 Difference]: Start difference. First operand has 218 places, 331 transitions, 4886 flow. Second operand 7 states and 105 transitions. [2024-06-04 17:48:48,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 340 transitions, 5586 flow [2024-06-04 17:48:49,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 340 transitions, 5451 flow, removed 53 selfloop flow, removed 3 redundant places. [2024-06-04 17:48:49,100 INFO L231 Difference]: Finished difference. Result has 222 places, 331 transitions, 4787 flow [2024-06-04 17:48:49,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4787, PETRI_PLACES=222, PETRI_TRANSITIONS=331} [2024-06-04 17:48:49,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-04 17:48:49,100 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 331 transitions, 4787 flow [2024-06-04 17:48:49,101 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 17:48:49,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:49,101 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 17:48:49,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:48:49,101 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 17:48:49,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 675797624, now seen corresponding path program 1 times [2024-06-04 17:48:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348838233] [2024-06-04 17:48:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:57,492 INFO 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 17:48:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348838233] [2024-06-04 17:48:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348838233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:57,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:48:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884663228] [2024-06-04 17:48:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:57,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:48:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:48:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:48:57,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:48:57,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 331 transitions, 4787 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:48:57,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:57,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:48:57,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:59,468 INFO L124 PetriNetUnfolderBase]: 3822/6175 cut-off events. [2024-06-04 17:48:59,468 INFO L125 PetriNetUnfolderBase]: For 220086/220159 co-relation queries the response was YES. [2024-06-04 17:48:59,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40803 conditions, 6175 events. 3822/6175 cut-off events. For 220086/220159 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 39417 event pairs, 1683 based on Foata normal form. 3/6139 useless extension candidates. Maximal degree in co-relation 40695. Up to 5855 conditions per place. [2024-06-04 17:48:59,525 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 319 selfloop transitions, 18 changer transitions 0/357 dead transitions. [2024-06-04 17:48:59,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 357 transitions, 5587 flow [2024-06-04 17:48:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:48:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:48:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:48:59,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-04 17:48:59,526 INFO L175 Difference]: Start difference. First operand has 222 places, 331 transitions, 4787 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:48:59,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 357 transitions, 5587 flow [2024-06-04 17:48:59,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 357 transitions, 5547 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:48:59,837 INFO L231 Difference]: Finished difference. Result has 225 places, 337 transitions, 4853 flow [2024-06-04 17:48:59,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4747, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4853, PETRI_PLACES=225, PETRI_TRANSITIONS=337} [2024-06-04 17:48:59,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places. [2024-06-04 17:48:59,838 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 337 transitions, 4853 flow [2024-06-04 17:48:59,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:48:59,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:59,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 17:48:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:48:59,838 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 17:48:59,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -661224218, now seen corresponding path program 1 times [2024-06-04 17:48:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432621644] [2024-06-04 17:48:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:08,353 INFO 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 17:49:08,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432621644] [2024-06-04 17:49:08,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432621644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:08,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:08,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:49:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431619578] [2024-06-04 17:49:08,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:08,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:49:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:49:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:49:08,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:49:08,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 337 transitions, 4853 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 17:49:08,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:08,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:49:08,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:10,220 INFO L124 PetriNetUnfolderBase]: 3913/6279 cut-off events. [2024-06-04 17:49:10,221 INFO L125 PetriNetUnfolderBase]: For 198406/198409 co-relation queries the response was YES. [2024-06-04 17:49:10,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41938 conditions, 6279 events. 3913/6279 cut-off events. For 198406/198409 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 39492 event pairs, 1111 based on Foata normal form. 4/6281 useless extension candidates. Maximal degree in co-relation 41828. Up to 5797 conditions per place. [2024-06-04 17:49:10,293 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 284 selfloop transitions, 82 changer transitions 0/370 dead transitions. [2024-06-04 17:49:10,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 370 transitions, 6038 flow [2024-06-04 17:49:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 17:49:10,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-04 17:49:10,295 INFO L175 Difference]: Start difference. First operand has 225 places, 337 transitions, 4853 flow. Second operand 9 states and 151 transitions. [2024-06-04 17:49:10,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 370 transitions, 6038 flow [2024-06-04 17:49:10,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 370 transitions, 5978 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 17:49:10,674 INFO L231 Difference]: Finished difference. Result has 230 places, 347 transitions, 5154 flow [2024-06-04 17:49:10,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4793, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5154, PETRI_PLACES=230, PETRI_TRANSITIONS=347} [2024-06-04 17:49:10,674 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places. [2024-06-04 17:49:10,675 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 347 transitions, 5154 flow [2024-06-04 17:49:10,675 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 17:49:10,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:10,675 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 17:49:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:49:10,675 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 17:49:10,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -951763954, now seen corresponding path program 2 times [2024-06-04 17:49:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996892897] [2024-06-04 17:49:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:20,363 INFO 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 17:49:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996892897] [2024-06-04 17:49:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996892897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:20,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:20,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:49:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592878925] [2024-06-04 17:49:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:20,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:49:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:49:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:49:20,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:49:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 347 transitions, 5154 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:49:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:49:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:22,414 INFO L124 PetriNetUnfolderBase]: 3927/6325 cut-off events. [2024-06-04 17:49:22,414 INFO L125 PetriNetUnfolderBase]: For 253110/253183 co-relation queries the response was YES. [2024-06-04 17:49:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44269 conditions, 6325 events. 3927/6325 cut-off events. For 253110/253183 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 40356 event pairs, 1675 based on Foata normal form. 5/6291 useless extension candidates. Maximal degree in co-relation 44157. Up to 5954 conditions per place. [2024-06-04 17:49:22,478 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 326 selfloop transitions, 29 changer transitions 0/375 dead transitions. [2024-06-04 17:49:22,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 375 transitions, 6146 flow [2024-06-04 17:49:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-04 17:49:22,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-04 17:49:22,479 INFO L175 Difference]: Start difference. First operand has 230 places, 347 transitions, 5154 flow. Second operand 9 states and 147 transitions. [2024-06-04 17:49:22,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 375 transitions, 6146 flow [2024-06-04 17:49:22,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 375 transitions, 5961 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-04 17:49:22,900 INFO L231 Difference]: Finished difference. Result has 235 places, 355 transitions, 5162 flow [2024-06-04 17:49:22,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4969, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5162, PETRI_PLACES=235, PETRI_TRANSITIONS=355} [2024-06-04 17:49:22,900 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-04 17:49:22,900 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 355 transitions, 5162 flow [2024-06-04 17:49:22,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:49:22,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:22,900 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 17:49:22,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:49:22,901 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 17:49:22,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash -661235378, now seen corresponding path program 2 times [2024-06-04 17:49:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693202997] [2024-06-04 17:49:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:31,420 INFO 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 17:49:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693202997] [2024-06-04 17:49:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693202997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:49:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427924375] [2024-06-04 17:49:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:31,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:49:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:49:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:49:31,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:49:31,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 355 transitions, 5162 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 17:49:31,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:31,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:49:31,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:33,350 INFO L124 PetriNetUnfolderBase]: 3999/6399 cut-off events. [2024-06-04 17:49:33,350 INFO L125 PetriNetUnfolderBase]: For 224194/224197 co-relation queries the response was YES. [2024-06-04 17:49:33,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44623 conditions, 6399 events. 3999/6399 cut-off events. For 224194/224197 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 40247 event pairs, 1121 based on Foata normal form. 4/6401 useless extension candidates. Maximal degree in co-relation 44508. Up to 5913 conditions per place. [2024-06-04 17:49:33,543 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 293 selfloop transitions, 84 changer transitions 0/381 dead transitions. [2024-06-04 17:49:33,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 381 transitions, 6196 flow [2024-06-04 17:49:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 17:49:33,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-04 17:49:33,544 INFO L175 Difference]: Start difference. First operand has 235 places, 355 transitions, 5162 flow. Second operand 9 states and 151 transitions. [2024-06-04 17:49:33,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 381 transitions, 6196 flow [2024-06-04 17:49:33,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 381 transitions, 6096 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-04 17:49:33,939 INFO L231 Difference]: Finished difference. Result has 238 places, 359 transitions, 5318 flow [2024-06-04 17:49:33,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5062, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5318, PETRI_PLACES=238, PETRI_TRANSITIONS=359} [2024-06-04 17:49:33,940 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 196 predicate places. [2024-06-04 17:49:33,940 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 359 transitions, 5318 flow [2024-06-04 17:49:33,941 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 17:49:33,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:33,941 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 17:49:33,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:49:33,941 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 17:49:33,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -453573106, now seen corresponding path program 3 times [2024-06-04 17:49:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838407075] [2024-06-04 17:49:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:43,101 INFO 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 17:49:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838407075] [2024-06-04 17:49:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838407075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:43,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:49:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748758940] [2024-06-04 17:49:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:49:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:49:43,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:49:43,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:49:43,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 359 transitions, 5318 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:49:43,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:43,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:49:43,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:45,150 INFO L124 PetriNetUnfolderBase]: 3936/6341 cut-off events. [2024-06-04 17:49:45,150 INFO L125 PetriNetUnfolderBase]: For 265891/265961 co-relation queries the response was YES. [2024-06-04 17:49:45,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45115 conditions, 6341 events. 3936/6341 cut-off events. For 265891/265961 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 40478 event pairs, 1672 based on Foata normal form. 8/6309 useless extension candidates. Maximal degree in co-relation 45000. Up to 5923 conditions per place. [2024-06-04 17:49:45,215 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 324 selfloop transitions, 42 changer transitions 0/386 dead transitions. [2024-06-04 17:49:45,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 386 transitions, 6442 flow [2024-06-04 17:49:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:49:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:49:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 17:49:45,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 17:49:45,216 INFO L175 Difference]: Start difference. First operand has 238 places, 359 transitions, 5318 flow. Second operand 8 states and 140 transitions. [2024-06-04 17:49:45,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 386 transitions, 6442 flow [2024-06-04 17:49:45,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 386 transitions, 6250 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-04 17:49:45,574 INFO L231 Difference]: Finished difference. Result has 241 places, 367 transitions, 5355 flow [2024-06-04 17:49:45,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5126, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5355, PETRI_PLACES=241, PETRI_TRANSITIONS=367} [2024-06-04 17:49:45,575 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-04 17:49:45,575 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 367 transitions, 5355 flow [2024-06-04 17:49:45,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 17:49:45,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:45,575 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 17:49:45,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:49:45,576 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 17:49:45,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1317553186, now seen corresponding path program 1 times [2024-06-04 17:49:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631118163] [2024-06-04 17:49:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631118163] [2024-06-04 17:49:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631118163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:49:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911231187] [2024-06-04 17:49:54,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:54,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:49:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:49:54,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:49:55,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:49:55,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 367 transitions, 5355 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 17:49:55,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:55,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:49:55,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:56,966 INFO L124 PetriNetUnfolderBase]: 3996/6405 cut-off events. [2024-06-04 17:49:56,966 INFO L125 PetriNetUnfolderBase]: For 236659/236659 co-relation queries the response was YES. [2024-06-04 17:49:57,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45014 conditions, 6405 events. 3996/6405 cut-off events. For 236659/236659 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 40395 event pairs, 1744 based on Foata normal form. 2/6406 useless extension candidates. Maximal degree in co-relation 44897. Up to 6204 conditions per place. [2024-06-04 17:49:57,034 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 359 selfloop transitions, 17 changer transitions 0/380 dead transitions. [2024-06-04 17:49:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6197 flow [2024-06-04 17:49:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:49:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:49:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-04 17:49:57,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567073170731707 [2024-06-04 17:49:57,035 INFO L175 Difference]: Start difference. First operand has 241 places, 367 transitions, 5355 flow. Second operand 8 states and 117 transitions. [2024-06-04 17:49:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6197 flow [2024-06-04 17:49:57,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 380 transitions, 6073 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-04 17:49:57,482 INFO L231 Difference]: Finished difference. Result has 244 places, 369 transitions, 5332 flow [2024-06-04 17:49:57,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5233, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5332, PETRI_PLACES=244, PETRI_TRANSITIONS=369} [2024-06-04 17:49:57,483 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-04 17:49:57,483 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 369 transitions, 5332 flow [2024-06-04 17:49:57,483 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 17:49:57,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:57,483 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 17:49:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:49:57,483 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 17:49:57,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1579335376, now seen corresponding path program 3 times [2024-06-04 17:49:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147298610] [2024-06-04 17:49:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147298610] [2024-06-04 17:50:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147298610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:50:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99462045] [2024-06-04 17:50:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:05,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:50:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:50:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:50:06,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:50:06,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 369 transitions, 5332 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 17:50:06,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:06,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:50:06,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:07,973 INFO L124 PetriNetUnfolderBase]: 4006/6416 cut-off events. [2024-06-04 17:50:07,974 INFO L125 PetriNetUnfolderBase]: For 238920/238929 co-relation queries the response was YES. [2024-06-04 17:50:08,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44676 conditions, 6416 events. 4006/6416 cut-off events. For 238920/238929 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40474 event pairs, 1183 based on Foata normal form. 10/6424 useless extension candidates. Maximal degree in co-relation 44558. Up to 6020 conditions per place. [2024-06-04 17:50:08,052 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 313 selfloop transitions, 80 changer transitions 0/397 dead transitions. [2024-06-04 17:50:08,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 397 transitions, 6286 flow [2024-06-04 17:50:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:50:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:50:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-04 17:50:08,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-04 17:50:08,054 INFO L175 Difference]: Start difference. First operand has 244 places, 369 transitions, 5332 flow. Second operand 9 states and 152 transitions. [2024-06-04 17:50:08,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 397 transitions, 6286 flow [2024-06-04 17:50:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 397 transitions, 6203 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:08,628 INFO L231 Difference]: Finished difference. Result has 247 places, 373 transitions, 5511 flow [2024-06-04 17:50:08,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5249, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5511, PETRI_PLACES=247, PETRI_TRANSITIONS=373} [2024-06-04 17:50:08,629 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places. [2024-06-04 17:50:08,629 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 373 transitions, 5511 flow [2024-06-04 17:50:08,629 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 17:50:08,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:08,629 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 17:50:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:50:08,629 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 17:50:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1382378665, now seen corresponding path program 1 times [2024-06-04 17:50:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497468078] [2024-06-04 17:50:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:17,775 INFO 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 17:50:17,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:17,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497468078] [2024-06-04 17:50:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497468078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:17,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:50:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984717416] [2024-06-04 17:50:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:17,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:50:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:50:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:50:17,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:50:17,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 373 transitions, 5511 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 17:50:17,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:17,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:50:17,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:19,847 INFO L124 PetriNetUnfolderBase]: 4016/6419 cut-off events. [2024-06-04 17:50:19,847 INFO L125 PetriNetUnfolderBase]: For 247308/247311 co-relation queries the response was YES. [2024-06-04 17:50:19,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45245 conditions, 6419 events. 4016/6419 cut-off events. For 247308/247311 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40304 event pairs, 1098 based on Foata normal form. 4/6421 useless extension candidates. Maximal degree in co-relation 45126. Up to 6044 conditions per place. [2024-06-04 17:50:19,914 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 325 selfloop transitions, 69 changer transitions 0/398 dead transitions. [2024-06-04 17:50:19,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 398 transitions, 6459 flow [2024-06-04 17:50:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:50:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:50:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 17:50:19,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-04 17:50:19,916 INFO L175 Difference]: Start difference. First operand has 247 places, 373 transitions, 5511 flow. Second operand 8 states and 137 transitions. [2024-06-04 17:50:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 398 transitions, 6459 flow [2024-06-04 17:50:20,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 398 transitions, 6239 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-04 17:50:20,402 INFO L231 Difference]: Finished difference. Result has 248 places, 377 transitions, 5533 flow [2024-06-04 17:50:20,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5291, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5533, PETRI_PLACES=248, PETRI_TRANSITIONS=377} [2024-06-04 17:50:20,403 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places. [2024-06-04 17:50:20,403 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 377 transitions, 5533 flow [2024-06-04 17:50:20,403 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 17:50:20,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:20,403 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 17:50:20,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:50:20,403 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 17:50:20,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1920497321, now seen corresponding path program 2 times [2024-06-04 17:50:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84873851] [2024-06-04 17:50:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:29,435 INFO 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 17:50:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84873851] [2024-06-04 17:50:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84873851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:50:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587315746] [2024-06-04 17:50:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:29,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:50:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:29,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:50:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:50:29,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:50:29,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 377 transitions, 5533 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 17:50:29,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:29,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:50:29,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:31,381 INFO L124 PetriNetUnfolderBase]: 4026/6438 cut-off events. [2024-06-04 17:50:31,382 INFO L125 PetriNetUnfolderBase]: For 255979/255982 co-relation queries the response was YES. [2024-06-04 17:50:31,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45474 conditions, 6438 events. 4026/6438 cut-off events. For 255979/255982 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40512 event pairs, 1116 based on Foata normal form. 4/6440 useless extension candidates. Maximal degree in co-relation 45354. Up to 5994 conditions per place. [2024-06-04 17:50:31,452 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 312 selfloop transitions, 84 changer transitions 0/400 dead transitions. [2024-06-04 17:50:31,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 400 transitions, 6589 flow [2024-06-04 17:50:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:50:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:50:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 17:50:31,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:50:31,453 INFO L175 Difference]: Start difference. First operand has 248 places, 377 transitions, 5533 flow. Second operand 8 states and 136 transitions. [2024-06-04 17:50:31,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 400 transitions, 6589 flow [2024-06-04 17:50:31,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 400 transitions, 6423 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:31,957 INFO L231 Difference]: Finished difference. Result has 250 places, 381 transitions, 5642 flow [2024-06-04 17:50:31,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5367, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5642, PETRI_PLACES=250, PETRI_TRANSITIONS=381} [2024-06-04 17:50:31,957 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-06-04 17:50:31,958 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 381 transitions, 5642 flow [2024-06-04 17:50:31,958 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 17:50:31,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:31,958 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 17:50:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:50:31,958 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 17:50:31,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash -126510844, now seen corresponding path program 4 times [2024-06-04 17:50:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724882086] [2024-06-04 17:50:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724882086] [2024-06-04 17:50:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724882086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:50:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503927645] [2024-06-04 17:50:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:40,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:50:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:50:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:50:40,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:50:40,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 381 transitions, 5642 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 17:50:40,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:40,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:50:40,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:42,806 INFO L124 PetriNetUnfolderBase]: 4038/6460 cut-off events. [2024-06-04 17:50:42,806 INFO L125 PetriNetUnfolderBase]: For 262647/262656 co-relation queries the response was YES. [2024-06-04 17:50:42,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45671 conditions, 6460 events. 4038/6460 cut-off events. For 262647/262656 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 40756 event pairs, 1103 based on Foata normal form. 10/6468 useless extension candidates. Maximal degree in co-relation 45550. Up to 6059 conditions per place. [2024-06-04 17:50:42,878 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 327 selfloop transitions, 80 changer transitions 0/411 dead transitions. [2024-06-04 17:50:42,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 411 transitions, 6650 flow [2024-06-04 17:50:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:50:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:50:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 17:50:42,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-04 17:50:42,879 INFO L175 Difference]: Start difference. First operand has 250 places, 381 transitions, 5642 flow. Second operand 9 states and 151 transitions. [2024-06-04 17:50:42,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 411 transitions, 6650 flow [2024-06-04 17:50:43,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 411 transitions, 6486 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-04 17:50:43,472 INFO L231 Difference]: Finished difference. Result has 254 places, 389 transitions, 5788 flow [2024-06-04 17:50:43,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5478, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5788, PETRI_PLACES=254, PETRI_TRANSITIONS=389} [2024-06-04 17:50:43,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-04 17:50:43,472 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 389 transitions, 5788 flow [2024-06-04 17:50:43,472 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 17:50:43,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:43,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 17:50:43,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:50:43,473 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 17:50:43,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1920489385, now seen corresponding path program 1 times [2024-06-04 17:50:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493691236] [2024-06-04 17:50:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:52,326 INFO 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 17:50:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493691236] [2024-06-04 17:50:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493691236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:52,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:50:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096410038] [2024-06-04 17:50:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:50:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:50:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:50:52,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:50:52,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 389 transitions, 5788 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 17:50:52,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:52,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:50:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:54,341 INFO L124 PetriNetUnfolderBase]: 4043/6468 cut-off events. [2024-06-04 17:50:54,341 INFO L125 PetriNetUnfolderBase]: For 271661/271667 co-relation queries the response was YES. [2024-06-04 17:50:54,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45982 conditions, 6468 events. 4043/6468 cut-off events. For 271661/271667 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 40773 event pairs, 1479 based on Foata normal form. 7/6474 useless extension candidates. Maximal degree in co-relation 45860. Up to 6252 conditions per place. [2024-06-04 17:50:54,412 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 383 selfloop transitions, 25 changer transitions 0/412 dead transitions. [2024-06-04 17:50:54,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 412 transitions, 6745 flow [2024-06-04 17:50:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:50:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:50:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-04 17:50:54,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37669376693766937 [2024-06-04 17:50:54,413 INFO L175 Difference]: Start difference. First operand has 254 places, 389 transitions, 5788 flow. Second operand 9 states and 139 transitions. [2024-06-04 17:50:54,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 412 transitions, 6745 flow [2024-06-04 17:50:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 412 transitions, 6529 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-04 17:50:54,907 INFO L231 Difference]: Finished difference. Result has 257 places, 393 transitions, 5719 flow [2024-06-04 17:50:54,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5572, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5719, PETRI_PLACES=257, PETRI_TRANSITIONS=393} [2024-06-04 17:50:54,908 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-04 17:50:54,908 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 393 transitions, 5719 flow [2024-06-04 17:50:54,908 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 17:50:54,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:54,908 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 17:50:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:50:54,909 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 17:50:54,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 711904568, now seen corresponding path program 5 times [2024-06-04 17:50:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423771094] [2024-06-04 17:50:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423771094] [2024-06-04 17:51:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423771094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:03,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:51:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467603890] [2024-06-04 17:51:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:03,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:51:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:51:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:51:03,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:51:03,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 393 transitions, 5719 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 17:51:03,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:03,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:51:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:05,993 INFO L124 PetriNetUnfolderBase]: 4053/6484 cut-off events. [2024-06-04 17:51:05,993 INFO L125 PetriNetUnfolderBase]: For 278437/278446 co-relation queries the response was YES. [2024-06-04 17:51:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46199 conditions, 6484 events. 4053/6484 cut-off events. For 278437/278446 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 40930 event pairs, 1180 based on Foata normal form. 10/6492 useless extension candidates. Maximal degree in co-relation 46075. Up to 6054 conditions per place. [2024-06-04 17:51:06,067 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 316 selfloop transitions, 97 changer transitions 0/417 dead transitions. [2024-06-04 17:51:06,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 417 transitions, 6721 flow [2024-06-04 17:51:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:51:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:51:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:51:06,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-04 17:51:06,068 INFO L175 Difference]: Start difference. First operand has 257 places, 393 transitions, 5719 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:51:06,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 417 transitions, 6721 flow [2024-06-04 17:51:06,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 417 transitions, 6611 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-04 17:51:06,626 INFO L231 Difference]: Finished difference. Result has 259 places, 397 transitions, 5939 flow [2024-06-04 17:51:06,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5609, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5939, PETRI_PLACES=259, PETRI_TRANSITIONS=397} [2024-06-04 17:51:06,626 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-04 17:51:06,626 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 397 transitions, 5939 flow [2024-06-04 17:51:06,626 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 17:51:06,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:06,627 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 17:51:06,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:51:06,627 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 17:51:06,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1721064045, now seen corresponding path program 3 times [2024-06-04 17:51:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485396465] [2024-06-04 17:51:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:15,386 INFO 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 17:51:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485396465] [2024-06-04 17:51:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485396465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:51:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96831049] [2024-06-04 17:51:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:15,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:51:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:15,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:51:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:51:15,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:51:15,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 397 transitions, 5939 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 17:51:15,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:15,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:51:15,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:17,469 INFO L124 PetriNetUnfolderBase]: 4065/6495 cut-off events. [2024-06-04 17:51:17,469 INFO L125 PetriNetUnfolderBase]: For 291121/291124 co-relation queries the response was YES. [2024-06-04 17:51:17,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47180 conditions, 6495 events. 4065/6495 cut-off events. For 291121/291124 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 40891 event pairs, 1163 based on Foata normal form. 6/6499 useless extension candidates. Maximal degree in co-relation 47055. Up to 6101 conditions per place. [2024-06-04 17:51:17,544 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 342 selfloop transitions, 76 changer transitions 0/422 dead transitions. [2024-06-04 17:51:17,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 422 transitions, 7008 flow [2024-06-04 17:51:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:51:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:51:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 17:51:17,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 17:51:17,547 INFO L175 Difference]: Start difference. First operand has 259 places, 397 transitions, 5939 flow. Second operand 7 states and 119 transitions. [2024-06-04 17:51:17,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 422 transitions, 7008 flow [2024-06-04 17:51:18,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 422 transitions, 6746 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-04 17:51:18,167 INFO L231 Difference]: Finished difference. Result has 260 places, 404 transitions, 6022 flow [2024-06-04 17:51:18,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5677, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6022, PETRI_PLACES=260, PETRI_TRANSITIONS=404} [2024-06-04 17:51:18,168 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places. [2024-06-04 17:51:18,168 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 404 transitions, 6022 flow [2024-06-04 17:51:18,168 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 17:51:18,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:18,168 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 17:51:18,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:51:18,169 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 17:51:18,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 721162625, now seen corresponding path program 4 times [2024-06-04 17:51:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115492446] [2024-06-04 17:51:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115492446] [2024-06-04 17:51:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115492446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:26,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:51:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130679129] [2024-06-04 17:51:26,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:26,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:51:26,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:51:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:51:26,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:51:26,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 404 transitions, 6022 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 17:51:26,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:26,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:51:26,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:28,663 INFO L124 PetriNetUnfolderBase]: 4067/6498 cut-off events. [2024-06-04 17:51:28,663 INFO L125 PetriNetUnfolderBase]: For 294214/294217 co-relation queries the response was YES. [2024-06-04 17:51:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47201 conditions, 6498 events. 4067/6498 cut-off events. For 294214/294217 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 40889 event pairs, 1113 based on Foata normal form. 4/6500 useless extension candidates. Maximal degree in co-relation 47075. Up to 6012 conditions per place. [2024-06-04 17:51:28,730 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 318 selfloop transitions, 100 changer transitions 0/422 dead transitions. [2024-06-04 17:51:28,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 422 transitions, 7096 flow [2024-06-04 17:51:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:51:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:51:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 17:51:28,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-04 17:51:28,731 INFO L175 Difference]: Start difference. First operand has 260 places, 404 transitions, 6022 flow. Second operand 7 states and 118 transitions. [2024-06-04 17:51:28,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 422 transitions, 7096 flow [2024-06-04 17:51:29,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 422 transitions, 6872 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-04 17:51:29,295 INFO L231 Difference]: Finished difference. Result has 262 places, 407 transitions, 6090 flow [2024-06-04 17:51:29,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5800, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6090, PETRI_PLACES=262, PETRI_TRANSITIONS=407} [2024-06-04 17:51:29,296 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2024-06-04 17:51:29,296 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 407 transitions, 6090 flow [2024-06-04 17:51:29,296 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 17:51:29,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:29,296 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 17:51:29,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:51:29,296 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 17:51:29,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 721170158, now seen corresponding path program 6 times [2024-06-04 17:51:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:29,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624623725] [2024-06-04 17:51:29,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:37,802 INFO 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 17:51:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624623725] [2024-06-04 17:51:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624623725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:37,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:51:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733527292] [2024-06-04 17:51:37,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:37,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:51:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:51:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:51:37,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:51:37,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 407 transitions, 6090 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 17:51:37,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:37,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:51:37,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:39,832 INFO L124 PetriNetUnfolderBase]: 4103/6553 cut-off events. [2024-06-04 17:51:39,833 INFO L125 PetriNetUnfolderBase]: For 301772/301775 co-relation queries the response was YES. [2024-06-04 17:51:39,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47959 conditions, 6553 events. 4103/6553 cut-off events. For 301772/301775 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 41342 event pairs, 1113 based on Foata normal form. 4/6555 useless extension candidates. Maximal degree in co-relation 47832. Up to 5949 conditions per place. [2024-06-04 17:51:39,911 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 304 selfloop transitions, 125 changer transitions 0/433 dead transitions. [2024-06-04 17:51:39,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 433 transitions, 7494 flow [2024-06-04 17:51:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:51:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:51:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:51:39,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-04 17:51:39,912 INFO L175 Difference]: Start difference. First operand has 262 places, 407 transitions, 6090 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:51:39,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 433 transitions, 7494 flow [2024-06-04 17:51:40,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 433 transitions, 7321 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-04 17:51:40,560 INFO L231 Difference]: Finished difference. Result has 267 places, 415 transitions, 6445 flow [2024-06-04 17:51:40,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5917, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6445, PETRI_PLACES=267, PETRI_TRANSITIONS=415} [2024-06-04 17:51:40,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places. [2024-06-04 17:51:40,561 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 415 transitions, 6445 flow [2024-06-04 17:51:40,561 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 17:51:40,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:40,561 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 17:51:40,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:51:40,561 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 17:51:40,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 721170561, now seen corresponding path program 2 times [2024-06-04 17:51:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695643199] [2024-06-04 17:51:40,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:40,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:49,591 INFO 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 17:51:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695643199] [2024-06-04 17:51:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695643199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:49,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:51:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306754598] [2024-06-04 17:51:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:51:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:51:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:51:49,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:51:49,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 415 transitions, 6445 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 17:51:49,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:49,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:51:49,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:51,685 INFO L124 PetriNetUnfolderBase]: 4108/6566 cut-off events. [2024-06-04 17:51:51,685 INFO L125 PetriNetUnfolderBase]: For 316662/316668 co-relation queries the response was YES. [2024-06-04 17:51:51,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48944 conditions, 6566 events. 4108/6566 cut-off events. For 316662/316668 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 41538 event pairs, 1480 based on Foata normal form. 7/6572 useless extension candidates. Maximal degree in co-relation 48815. Up to 6334 conditions per place. [2024-06-04 17:51:51,768 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 397 selfloop transitions, 32 changer transitions 0/433 dead transitions. [2024-06-04 17:51:51,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 433 transitions, 7439 flow [2024-06-04 17:51:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:51:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:51:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-04 17:51:51,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:51:51,769 INFO L175 Difference]: Start difference. First operand has 267 places, 415 transitions, 6445 flow. Second operand 8 states and 123 transitions. [2024-06-04 17:51:51,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 433 transitions, 7439 flow [2024-06-04 17:51:52,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 433 transitions, 7197 flow, removed 65 selfloop flow, removed 4 redundant places. [2024-06-04 17:51:52,512 INFO L231 Difference]: Finished difference. Result has 271 places, 418 transitions, 6369 flow [2024-06-04 17:51:52,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6207, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6369, PETRI_PLACES=271, PETRI_TRANSITIONS=418} [2024-06-04 17:51:52,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places. [2024-06-04 17:51:52,512 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 418 transitions, 6369 flow [2024-06-04 17:51:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:52,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:52,513 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 17:51:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:51:52,513 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 17:51:52,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1968412784, now seen corresponding path program 7 times [2024-06-04 17:51:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063170405] [2024-06-04 17:51:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:01,002 INFO 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 17:52:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063170405] [2024-06-04 17:52:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063170405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:01,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:01,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:52:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798132929] [2024-06-04 17:52:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:01,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:52:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:52:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:52:01,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:52:01,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 418 transitions, 6369 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 17:52:01,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:01,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:52:01,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:03,157 INFO L124 PetriNetUnfolderBase]: 4112/6566 cut-off events. [2024-06-04 17:52:03,158 INFO L125 PetriNetUnfolderBase]: For 310461/310464 co-relation queries the response was YES. [2024-06-04 17:52:03,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48828 conditions, 6566 events. 4112/6566 cut-off events. For 310461/310464 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 41385 event pairs, 1109 based on Foata normal form. 4/6568 useless extension candidates. Maximal degree in co-relation 48697. Up to 5963 conditions per place. [2024-06-04 17:52:03,235 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 306 selfloop transitions, 128 changer transitions 0/438 dead transitions. [2024-06-04 17:52:03,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 438 transitions, 7518 flow [2024-06-04 17:52:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:52:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:52:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:52:03,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-04 17:52:03,236 INFO L175 Difference]: Start difference. First operand has 271 places, 418 transitions, 6369 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:52:03,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 438 transitions, 7518 flow [2024-06-04 17:52:03,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 438 transitions, 7392 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-04 17:52:03,869 INFO L231 Difference]: Finished difference. Result has 273 places, 422 transitions, 6622 flow [2024-06-04 17:52:03,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6622, PETRI_PLACES=273, PETRI_TRANSITIONS=422} [2024-06-04 17:52:03,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-04 17:52:03,870 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 422 transitions, 6622 flow [2024-06-04 17:52:03,870 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 17:52:03,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:03,870 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 17:52:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:52:03,870 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 17:52:03,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 559695843, now seen corresponding path program 5 times [2024-06-04 17:52:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378613239] [2024-06-04 17:52:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:12,781 INFO 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 17:52:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378613239] [2024-06-04 17:52:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378613239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:12,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:52:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923482201] [2024-06-04 17:52:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:12,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:52:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:52:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:52:12,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:52:12,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 422 transitions, 6622 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 17:52:12,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:12,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:52:12,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:14,911 INFO L124 PetriNetUnfolderBase]: 4098/6540 cut-off events. [2024-06-04 17:52:14,911 INFO L125 PetriNetUnfolderBase]: For 316320/316320 co-relation queries the response was YES. [2024-06-04 17:52:14,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49025 conditions, 6540 events. 4098/6540 cut-off events. For 316320/316320 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 41129 event pairs, 1110 based on Foata normal form. 2/6528 useless extension candidates. Maximal degree in co-relation 48893. Up to 6167 conditions per place. [2024-06-04 17:52:14,991 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 360 selfloop transitions, 74 changer transitions 0/438 dead transitions. [2024-06-04 17:52:14,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 438 transitions, 7561 flow [2024-06-04 17:52:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:52:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:52:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 17:52:14,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-04 17:52:14,993 INFO L175 Difference]: Start difference. First operand has 273 places, 422 transitions, 6622 flow. Second operand 8 states and 127 transitions. [2024-06-04 17:52:14,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 438 transitions, 7561 flow [2024-06-04 17:52:15,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 438 transitions, 7268 flow, removed 62 selfloop flow, removed 5 redundant places. [2024-06-04 17:52:15,783 INFO L231 Difference]: Finished difference. Result has 276 places, 422 transitions, 6487 flow [2024-06-04 17:52:15,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6329, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6487, PETRI_PLACES=276, PETRI_TRANSITIONS=422} [2024-06-04 17:52:15,784 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2024-06-04 17:52:15,784 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 422 transitions, 6487 flow [2024-06-04 17:52:15,784 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 17:52:15,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:15,784 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 17:52:15,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:52:15,784 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 17:52:15,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -521397771, now seen corresponding path program 6 times [2024-06-04 17:52:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590760157] [2024-06-04 17:52:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:24,776 INFO 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 17:52:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590760157] [2024-06-04 17:52:24,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590760157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:24,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:52:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262322713] [2024-06-04 17:52:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:24,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:52:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:52:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:52:24,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:52:24,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 422 transitions, 6487 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 17:52:24,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:24,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:52:24,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:26,797 INFO L124 PetriNetUnfolderBase]: 4103/6544 cut-off events. [2024-06-04 17:52:26,798 INFO L125 PetriNetUnfolderBase]: For 312448/312448 co-relation queries the response was YES. [2024-06-04 17:52:26,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48809 conditions, 6544 events. 4103/6544 cut-off events. For 312448/312448 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 41112 event pairs, 1104 based on Foata normal form. 1/6531 useless extension candidates. Maximal degree in co-relation 48676. Up to 6142 conditions per place. [2024-06-04 17:52:26,877 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 346 selfloop transitions, 88 changer transitions 0/438 dead transitions. [2024-06-04 17:52:26,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 438 transitions, 7466 flow [2024-06-04 17:52:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:52:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:52:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-04 17:52:26,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-04 17:52:26,878 INFO L175 Difference]: Start difference. First operand has 276 places, 422 transitions, 6487 flow. Second operand 7 states and 115 transitions. [2024-06-04 17:52:26,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 438 transitions, 7466 flow [2024-06-04 17:52:27,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 438 transitions, 7197 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:52:27,556 INFO L231 Difference]: Finished difference. Result has 277 places, 426 transitions, 6507 flow [2024-06-04 17:52:27,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6218, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6507, PETRI_PLACES=277, PETRI_TRANSITIONS=426} [2024-06-04 17:52:27,557 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-04 17:52:27,557 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 426 transitions, 6507 flow [2024-06-04 17:52:27,557 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 17:52:27,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:27,557 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 17:52:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:52:27,558 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 17:52:27,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1175871103, now seen corresponding path program 7 times [2024-06-04 17:52:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554498874] [2024-06-04 17:52:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:35,999 INFO 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 17:52:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554498874] [2024-06-04 17:52:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554498874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:52:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825963932] [2024-06-04 17:52:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:36,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:52:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:52:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:52:36,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:52:36,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 426 transitions, 6507 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 17:52:36,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:36,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:52:36,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:37,964 INFO L124 PetriNetUnfolderBase]: 4108/6561 cut-off events. [2024-06-04 17:52:37,965 INFO L125 PetriNetUnfolderBase]: For 322876/322879 co-relation queries the response was YES. [2024-06-04 17:52:38,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49018 conditions, 6561 events. 4108/6561 cut-off events. For 322876/322879 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 41316 event pairs, 1135 based on Foata normal form. 3/6543 useless extension candidates. Maximal degree in co-relation 48883. Up to 6036 conditions per place. [2024-06-04 17:52:38,042 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 316 selfloop transitions, 119 changer transitions 0/439 dead transitions. [2024-06-04 17:52:38,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 439 transitions, 7589 flow [2024-06-04 17:52:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:52:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:52:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:52:38,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 17:52:38,044 INFO L175 Difference]: Start difference. First operand has 277 places, 426 transitions, 6507 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:52:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 439 transitions, 7589 flow [2024-06-04 17:52:38,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 439 transitions, 7316 flow, removed 61 selfloop flow, removed 5 redundant places. [2024-06-04 17:52:38,776 INFO L231 Difference]: Finished difference. Result has 279 places, 429 transitions, 6542 flow [2024-06-04 17:52:38,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6542, PETRI_PLACES=279, PETRI_TRANSITIONS=429} [2024-06-04 17:52:38,776 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 237 predicate places. [2024-06-04 17:52:38,776 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 429 transitions, 6542 flow [2024-06-04 17:52:38,776 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 17:52:38,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:38,776 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 17:52:38,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:52:38,776 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 17:52:38,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1181585023, now seen corresponding path program 8 times [2024-06-04 17:52:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072300346] [2024-06-04 17:52:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:47,907 INFO 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 17:52:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072300346] [2024-06-04 17:52:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072300346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:47,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:47,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:52:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650840085] [2024-06-04 17:52:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:47,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:52:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:47,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:52:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:52:47,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:52:47,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 429 transitions, 6542 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 17:52:47,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:47,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:52:47,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:49,965 INFO L124 PetriNetUnfolderBase]: 4100/6549 cut-off events. [2024-06-04 17:52:49,966 INFO L125 PetriNetUnfolderBase]: For 301001/301004 co-relation queries the response was YES. [2024-06-04 17:52:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47674 conditions, 6549 events. 4100/6549 cut-off events. For 301001/301004 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41262 event pairs, 1135 based on Foata normal form. 4/6532 useless extension candidates. Maximal degree in co-relation 47539. Up to 6028 conditions per place. [2024-06-04 17:52:50,047 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 325 selfloop transitions, 109 changer transitions 0/438 dead transitions. [2024-06-04 17:52:50,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 438 transitions, 7438 flow [2024-06-04 17:52:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:52:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:52:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:52:50,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 17:52:50,049 INFO L175 Difference]: Start difference. First operand has 279 places, 429 transitions, 6542 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:52:50,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 438 transitions, 7438 flow [2024-06-04 17:52:50,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 438 transitions, 7104 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-04 17:52:50,753 INFO L231 Difference]: Finished difference. Result has 280 places, 429 transitions, 6434 flow [2024-06-04 17:52:50,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6208, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6434, PETRI_PLACES=280, PETRI_TRANSITIONS=429} [2024-06-04 17:52:50,753 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-06-04 17:52:50,753 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 429 transitions, 6434 flow [2024-06-04 17:52:50,753 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 17:52:50,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:50,753 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 17:52:50,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:52:50,753 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 17:52:50,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1168690077, now seen corresponding path program 3 times [2024-06-04 17:52:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992827024] [2024-06-04 17:52:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992827024] [2024-06-04 17:53:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992827024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452300630] [2024-06-04 17:53:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:00,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:00,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:53:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 429 transitions, 6434 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 17:53:00,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:00,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:53:00,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:02,776 INFO L124 PetriNetUnfolderBase]: 4105/6562 cut-off events. [2024-06-04 17:53:02,776 INFO L125 PetriNetUnfolderBase]: For 310926/310926 co-relation queries the response was YES. [2024-06-04 17:53:02,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47723 conditions, 6562 events. 4105/6562 cut-off events. For 310926/310926 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 41490 event pairs, 1750 based on Foata normal form. 1/6562 useless extension candidates. Maximal degree in co-relation 47589. Up to 6360 conditions per place. [2024-06-04 17:53:02,845 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 420 selfloop transitions, 18 changer transitions 0/442 dead transitions. [2024-06-04 17:53:02,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 442 transitions, 7424 flow [2024-06-04 17:53:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-04 17:53:02,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567073170731707 [2024-06-04 17:53:02,846 INFO L175 Difference]: Start difference. First operand has 280 places, 429 transitions, 6434 flow. Second operand 8 states and 117 transitions. [2024-06-04 17:53:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 442 transitions, 7424 flow [2024-06-04 17:53:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 442 transitions, 7196 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:03,599 INFO L231 Difference]: Finished difference. Result has 282 places, 432 transitions, 6338 flow [2024-06-04 17:53:03,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6206, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6338, PETRI_PLACES=282, PETRI_TRANSITIONS=432} [2024-06-04 17:53:03,599 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places. [2024-06-04 17:53:03,599 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 432 transitions, 6338 flow [2024-06-04 17:53:03,600 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 17:53:03,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:03,600 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 17:53:03,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:53:03,600 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 17:53:03,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1181577490, now seen corresponding path program 8 times [2024-06-04 17:53:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077439142] [2024-06-04 17:53:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:12,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 17:53:12,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077439142] [2024-06-04 17:53:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077439142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:12,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356015774] [2024-06-04 17:53:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:12,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:53:12,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 432 transitions, 6338 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 17:53:12,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:12,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:53:12,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:14,400 INFO L124 PetriNetUnfolderBase]: 4141/6613 cut-off events. [2024-06-04 17:53:14,401 INFO L125 PetriNetUnfolderBase]: For 326646/326649 co-relation queries the response was YES. [2024-06-04 17:53:14,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48517 conditions, 6613 events. 4141/6613 cut-off events. For 326646/326649 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 41803 event pairs, 1134 based on Foata normal form. 4/6596 useless extension candidates. Maximal degree in co-relation 48382. Up to 5908 conditions per place. [2024-06-04 17:53:14,489 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 313 selfloop transitions, 142 changer transitions 0/459 dead transitions. [2024-06-04 17:53:14,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 459 transitions, 8056 flow [2024-06-04 17:53:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:53:14,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-04 17:53:14,490 INFO L175 Difference]: Start difference. First operand has 282 places, 432 transitions, 6338 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:53:14,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 459 transitions, 8056 flow [2024-06-04 17:53:15,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 459 transitions, 7946 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:15,270 INFO L231 Difference]: Finished difference. Result has 285 places, 443 transitions, 6818 flow [2024-06-04 17:53:15,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6228, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6818, PETRI_PLACES=285, PETRI_TRANSITIONS=443} [2024-06-04 17:53:15,271 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-04 17:53:15,271 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 443 transitions, 6818 flow [2024-06-04 17:53:15,271 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 17:53:15,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:15,271 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 17:53:15,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:53:15,271 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 17:53:15,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1652540144, now seen corresponding path program 9 times [2024-06-04 17:53:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140710057] [2024-06-04 17:53:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:23,963 INFO 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 17:53:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140710057] [2024-06-04 17:53:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140710057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053093161] [2024-06-04 17:53:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:24,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:53:24,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 443 transitions, 6818 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 17:53:24,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:24,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:53:24,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:26,080 INFO L124 PetriNetUnfolderBase]: 4145/6627 cut-off events. [2024-06-04 17:53:26,080 INFO L125 PetriNetUnfolderBase]: For 342747/342750 co-relation queries the response was YES. [2024-06-04 17:53:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49596 conditions, 6627 events. 4145/6627 cut-off events. For 342747/342750 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 42057 event pairs, 1750 based on Foata normal form. 4/6629 useless extension candidates. Maximal degree in co-relation 49459. Up to 6377 conditions per place. [2024-06-04 17:53:26,162 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 421 selfloop transitions, 34 changer transitions 0/459 dead transitions. [2024-06-04 17:53:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 459 transitions, 8040 flow [2024-06-04 17:53:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-04 17:53:26,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2024-06-04 17:53:26,163 INFO L175 Difference]: Start difference. First operand has 285 places, 443 transitions, 6818 flow. Second operand 8 states and 124 transitions. [2024-06-04 17:53:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 459 transitions, 8040 flow [2024-06-04 17:53:26,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 459 transitions, 7623 flow, removed 97 selfloop flow, removed 4 redundant places. [2024-06-04 17:53:26,909 INFO L231 Difference]: Finished difference. Result has 290 places, 448 transitions, 6645 flow [2024-06-04 17:53:26,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6425, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6645, PETRI_PLACES=290, PETRI_TRANSITIONS=448} [2024-06-04 17:53:26,910 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places. [2024-06-04 17:53:26,910 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 448 transitions, 6645 flow [2024-06-04 17:53:26,910 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 17:53:26,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:26,910 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 17:53:26,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:53:26,911 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 17:53:26,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1168244607, now seen corresponding path program 4 times [2024-06-04 17:53:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412501503] [2024-06-04 17:53:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15