./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix052_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix052_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix052_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:28:29,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:28:29,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:28:29,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:28:29,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:28:29,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:28:29,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:28:29,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:28:29,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:28:29,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:28:29,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:28:29,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:28:29,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:28:29,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:28:29,498 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:28:29,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:28:29,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:28:29,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:28:29,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:28:29,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:28:29,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:28:29,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:28:29,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:28:29,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:28:29,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:28:29,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:28:29,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:28:29,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:28:29,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:28:29,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:28:29,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:28:29,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:28:29,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:28:29,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:28:29,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:28:29,504 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:28:29,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:28:29,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:28:29,505 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 [2024-06-27 22:28:29,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:28:29,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:28:29,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:28:29,749 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:28:29,749 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:28:29,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix052_tso.oepc.yml/witness.yml [2024-06-27 22:28:29,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:28:29,863 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:28:29,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-27 22:28:30,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:28:31,081 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:28:31,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-27 22:28:31,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a5065d0/12f42208658d49a5b80707413d5c3b89/FLAG0c715fc28 [2024-06-27 22:28:31,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a5065d0/12f42208658d49a5b80707413d5c3b89 [2024-06-27 22:28:31,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:28:31,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:28:31,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:28:31,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:28:31,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:28:31,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:28:29" (1/2) ... [2024-06-27 22:28:31,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f613df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:28:31, skipping insertion in model container [2024-06-27 22:28:31,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:28:29" (1/2) ... [2024-06-27 22:28:31,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2853c40d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:28:31, skipping insertion in model container [2024-06-27 22:28:31,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:28:31" (2/2) ... [2024-06-27 22:28:31,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f613df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31, skipping insertion in model container [2024-06-27 22:28:31,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:28:31" (2/2) ... [2024-06-27 22:28:31,126 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:28:31,152 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:28:31,153 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:28:31,153 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:28:31,153 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:28:31,153 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:28:31,154 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-27 22:28:31,187 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:28:31,317 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962] [2024-06-27 22:28:31,443 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:28:31,458 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:28:31,495 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:28:31,697 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:28:31,732 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:28:31,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31 WrapperNode [2024-06-27 22:28:31,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:28:31,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:28:31,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:28:31,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:28:31,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,790 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2024-06-27 22:28:31,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:28:31,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:28:31,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:28:31,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:28:31,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,817 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-27 22:28:31,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:28:31,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:28:31,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:28:31,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:28:31,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (1/1) ... [2024-06-27 22:28:31,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:28:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:28:31,874 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-27 22:28:31,903 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-27 22:28:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:28:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:28:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:28:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:28:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:28:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:28:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:28:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:28:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:28:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:28:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:28:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:28:31,919 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:28:32,055 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:28:32,058 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:28:32,429 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:28:32,430 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:28:32,538 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:28:32,538 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:28:32,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:28:32 BoogieIcfgContainer [2024-06-27 22:28:32,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:28:32,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:28:32,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:28:32,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:28:32,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:28:29" (1/4) ... [2024-06-27 22:28:32,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e97a226 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:28:32, skipping insertion in model container [2024-06-27 22:28:32,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:28:31" (2/4) ... [2024-06-27 22:28:32,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e97a226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:28:32, skipping insertion in model container [2024-06-27 22:28:32,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:28:31" (3/4) ... [2024-06-27 22:28:32,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e97a226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:28:32, skipping insertion in model container [2024-06-27 22:28:32,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:28:32" (4/4) ... [2024-06-27 22:28:32,544 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2024-06-27 22:28:32,556 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:28:32,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:28:32,556 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:28:32,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:28:32,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:28:32,660 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-27 22:28:32,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:28:32,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-27 22:28:32,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:28:32,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-27 22:28:32,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:28:32,674 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;@7ae1a26a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:28:32,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:28:32,677 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:28:32,677 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:28:32,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:28:32,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:32,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:28:32,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:32,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash 354753175, now seen corresponding path program 1 times [2024-06-27 22:28:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:32,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844855694] [2024-06-27 22:28:32,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844855694] [2024-06-27 22:28:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844855694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:28:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853496487] [2024-06-27 22:28:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:33,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:28:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:28:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:28:33,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-06-27 22:28:33,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:33,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:33,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-06-27 22:28:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:34,352 INFO L124 PetriNetUnfolderBase]: 3596/5452 cut-off events. [2024-06-27 22:28:34,352 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-27 22:28:34,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10731 conditions, 5452 events. 3596/5452 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 31592 event pairs, 2139 based on Foata normal form. 180/5326 useless extension candidates. Maximal degree in co-relation 10719. Up to 5177 conditions per place. [2024-06-27 22:28:34,378 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-06-27 22:28:34,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 221 flow [2024-06-27 22:28:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:28:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:28:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 22:28:34,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-06-27 22:28:34,388 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 94 transitions. [2024-06-27 22:28:34,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 221 flow [2024-06-27 22:28:34,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:28:34,395 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 122 flow [2024-06-27 22:28:34,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-27 22:28:34,398 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 22:28:34,399 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 122 flow [2024-06-27 22:28:34,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:34,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:34,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:34,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:28:34,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:34,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1616673920, now seen corresponding path program 1 times [2024-06-27 22:28:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149701983] [2024-06-27 22:28:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:35,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-27 22:28:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149701983] [2024-06-27 22:28:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149701983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:35,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:28:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480314622] [2024-06-27 22:28:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:35,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:28:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:28:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:28:35,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 22:28:35,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:35,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:35,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 22:28:35,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:35,665 INFO L124 PetriNetUnfolderBase]: 4291/6327 cut-off events. [2024-06-27 22:28:35,665 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2024-06-27 22:28:35,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14017 conditions, 6327 events. 4291/6327 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36104 event pairs, 2403 based on Foata normal form. 3/6003 useless extension candidates. Maximal degree in co-relation 14005. Up to 6120 conditions per place. [2024-06-27 22:28:35,691 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 55 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2024-06-27 22:28:35,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 312 flow [2024-06-27 22:28:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:28:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:28:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-06-27 22:28:35,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2024-06-27 22:28:35,695 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 122 flow. Second operand 4 states and 118 transitions. [2024-06-27 22:28:35,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 312 flow [2024-06-27 22:28:35,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:28:35,701 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 160 flow [2024-06-27 22:28:35,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-27 22:28:35,702 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-06-27 22:28:35,703 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 160 flow [2024-06-27 22:28:35,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:35,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:35,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:35,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:28:35,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:35,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1422714426, now seen corresponding path program 1 times [2024-06-27 22:28:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:35,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068577429] [2024-06-27 22:28:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068577429] [2024-06-27 22:28:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068577429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:36,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:28:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750479893] [2024-06-27 22:28:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:28:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:28:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:28:36,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 22:28:36,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:36,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:36,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 22:28:36,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:36,942 INFO L124 PetriNetUnfolderBase]: 4233/6768 cut-off events. [2024-06-27 22:28:36,942 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2024-06-27 22:28:36,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15714 conditions, 6768 events. 4233/6768 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 42861 event pairs, 2124 based on Foata normal form. 6/6287 useless extension candidates. Maximal degree in co-relation 15700. Up to 6009 conditions per place. [2024-06-27 22:28:36,975 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 65 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-06-27 22:28:36,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 442 flow [2024-06-27 22:28:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:28:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:28:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-06-27 22:28:36,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2024-06-27 22:28:36,980 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 160 flow. Second operand 5 states and 141 transitions. [2024-06-27 22:28:36,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 442 flow [2024-06-27 22:28:36,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 416 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:28:36,984 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 261 flow [2024-06-27 22:28:36,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2024-06-27 22:28:36,985 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-06-27 22:28:36,985 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 261 flow [2024-06-27 22:28:36,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:36,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:36,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:36,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:28:36,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:36,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 294190031, now seen corresponding path program 1 times [2024-06-27 22:28:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338295952] [2024-06-27 22:28:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338295952] [2024-06-27 22:28:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338295952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:38,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:38,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:28:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094217137] [2024-06-27 22:28:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:38,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:28:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:28:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:28:38,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 22:28:38,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-27 22:28:38,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:38,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 22:28:38,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:38,737 INFO L124 PetriNetUnfolderBase]: 4187/6684 cut-off events. [2024-06-27 22:28:38,737 INFO L125 PetriNetUnfolderBase]: For 4655/4655 co-relation queries the response was YES. [2024-06-27 22:28:38,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17051 conditions, 6684 events. 4187/6684 cut-off events. For 4655/4655 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 41773 event pairs, 2074 based on Foata normal form. 6/6221 useless extension candidates. Maximal degree in co-relation 17034. Up to 5901 conditions per place. [2024-06-27 22:28:38,766 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 71 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-27 22:28:38,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 531 flow [2024-06-27 22:28:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:28:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:28:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-06-27 22:28:38,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5905797101449275 [2024-06-27 22:28:38,769 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 261 flow. Second operand 6 states and 163 transitions. [2024-06-27 22:28:38,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 531 flow [2024-06-27 22:28:38,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 523 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 22:28:38,775 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 313 flow [2024-06-27 22:28:38,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2024-06-27 22:28:38,777 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2024-06-27 22:28:38,777 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 313 flow [2024-06-27 22:28:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-27 22:28:38,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:38,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:38,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:28:38,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:38,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash -802234893, now seen corresponding path program 1 times [2024-06-27 22:28:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941061556] [2024-06-27 22:28:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:39,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941061556] [2024-06-27 22:28:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941061556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:39,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:28:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073567734] [2024-06-27 22:28:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:39,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:28:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:28:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:28:39,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 22:28:39,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:39,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:39,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 22:28:39,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:40,228 INFO L124 PetriNetUnfolderBase]: 3877/6298 cut-off events. [2024-06-27 22:28:40,229 INFO L125 PetriNetUnfolderBase]: For 7162/7162 co-relation queries the response was YES. [2024-06-27 22:28:40,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17151 conditions, 6298 events. 3877/6298 cut-off events. For 7162/7162 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 40015 event pairs, 2639 based on Foata normal form. 2/5875 useless extension candidates. Maximal degree in co-relation 17130. Up to 5557 conditions per place. [2024-06-27 22:28:40,257 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 65 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-27 22:28:40,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 565 flow [2024-06-27 22:28:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:28:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:28:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-27 22:28:40,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47101449275362317 [2024-06-27 22:28:40,259 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 313 flow. Second operand 6 states and 130 transitions. [2024-06-27 22:28:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 565 flow [2024-06-27 22:28:40,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 86 transitions, 515 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:28:40,269 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 384 flow [2024-06-27 22:28:40,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2024-06-27 22:28:40,270 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2024-06-27 22:28:40,273 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 384 flow [2024-06-27 22:28:40,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:40,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:40,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:28:40,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:40,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash 51928942, now seen corresponding path program 1 times [2024-06-27 22:28:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201126024] [2024-06-27 22:28:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201126024] [2024-06-27 22:28:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201126024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:28:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850420012] [2024-06-27 22:28:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:28:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:28:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:28:41,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:41,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:41,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:41,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:41,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:41,907 INFO L124 PetriNetUnfolderBase]: 4742/7551 cut-off events. [2024-06-27 22:28:41,908 INFO L125 PetriNetUnfolderBase]: For 10895/10895 co-relation queries the response was YES. [2024-06-27 22:28:41,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 7551 events. 4742/7551 cut-off events. For 10895/10895 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 47646 event pairs, 3069 based on Foata normal form. 2/7054 useless extension candidates. Maximal degree in co-relation 21723. Up to 6735 conditions per place. [2024-06-27 22:28:41,941 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 84 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-06-27 22:28:41,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 748 flow [2024-06-27 22:28:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:28:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:28:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 22:28:41,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937888198757764 [2024-06-27 22:28:41,942 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 384 flow. Second operand 7 states and 159 transitions. [2024-06-27 22:28:41,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 748 flow [2024-06-27 22:28:41,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 114 transitions, 736 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:28:41,952 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 538 flow [2024-06-27 22:28:41,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=538, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2024-06-27 22:28:41,954 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2024-06-27 22:28:41,954 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 538 flow [2024-06-27 22:28:41,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:41,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:41,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:28:41,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:41,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2140655186, now seen corresponding path program 2 times [2024-06-27 22:28:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38776874] [2024-06-27 22:28:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38776874] [2024-06-27 22:28:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38776874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:42,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:28:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492809181] [2024-06-27 22:28:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:42,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:28:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:28:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:28:42,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:42,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:42,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:42,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:43,589 INFO L124 PetriNetUnfolderBase]: 4788/7621 cut-off events. [2024-06-27 22:28:43,589 INFO L125 PetriNetUnfolderBase]: For 15532/15532 co-relation queries the response was YES. [2024-06-27 22:28:43,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23753 conditions, 7621 events. 4788/7621 cut-off events. For 15532/15532 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48120 event pairs, 3059 based on Foata normal form. 2/7122 useless extension candidates. Maximal degree in co-relation 23724. Up to 6785 conditions per place. [2024-06-27 22:28:43,632 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 83 selfloop transitions, 29 changer transitions 0/120 dead transitions. [2024-06-27 22:28:43,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 120 transitions, 936 flow [2024-06-27 22:28:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:28:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:28:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-27 22:28:43,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:28:43,634 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 538 flow. Second operand 6 states and 138 transitions. [2024-06-27 22:28:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 120 transitions, 936 flow [2024-06-27 22:28:43,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 120 transitions, 888 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 22:28:43,650 INFO L231 Difference]: Finished difference. Result has 80 places, 100 transitions, 692 flow [2024-06-27 22:28:43,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=80, PETRI_TRANSITIONS=100} [2024-06-27 22:28:43,650 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2024-06-27 22:28:43,651 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 692 flow [2024-06-27 22:28:43,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:43,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:43,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:43,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:28:43,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:43,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2146398866, now seen corresponding path program 3 times [2024-06-27 22:28:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501600194] [2024-06-27 22:28:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501600194] [2024-06-27 22:28:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501600194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:28:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563689035] [2024-06-27 22:28:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:28:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:28:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:28:44,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:44,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:44,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:44,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:44,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:45,457 INFO L124 PetriNetUnfolderBase]: 4783/7619 cut-off events. [2024-06-27 22:28:45,458 INFO L125 PetriNetUnfolderBase]: For 20397/20397 co-relation queries the response was YES. [2024-06-27 22:28:45,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25138 conditions, 7619 events. 4783/7619 cut-off events. For 20397/20397 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48140 event pairs, 3045 based on Foata normal form. 2/7118 useless extension candidates. Maximal degree in co-relation 25107. Up to 6739 conditions per place. [2024-06-27 22:28:45,487 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 76 selfloop transitions, 40 changer transitions 0/124 dead transitions. [2024-06-27 22:28:45,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 124 transitions, 1024 flow [2024-06-27 22:28:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:28:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:28:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-27 22:28:45,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:28:45,488 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 692 flow. Second operand 6 states and 138 transitions. [2024-06-27 22:28:45,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 124 transitions, 1024 flow [2024-06-27 22:28:45,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 124 transitions, 985 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:28:45,498 INFO L231 Difference]: Finished difference. Result has 85 places, 104 transitions, 790 flow [2024-06-27 22:28:45,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=85, PETRI_TRANSITIONS=104} [2024-06-27 22:28:45,499 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2024-06-27 22:28:45,499 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 790 flow [2024-06-27 22:28:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-27 22:28:45,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:45,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:28:45,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:45,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2146407794, now seen corresponding path program 1 times [2024-06-27 22:28:45,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242738569] [2024-06-27 22:28:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:46,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-27 22:28:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242738569] [2024-06-27 22:28:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242738569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:28:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767073561] [2024-06-27 22:28:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:28:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:28:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:28:46,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:46,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 790 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:46,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:47,994 INFO L124 PetriNetUnfolderBase]: 4724/7592 cut-off events. [2024-06-27 22:28:48,008 INFO L125 PetriNetUnfolderBase]: For 26081/26081 co-relation queries the response was YES. [2024-06-27 22:28:48,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26209 conditions, 7592 events. 4724/7592 cut-off events. For 26081/26081 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 48029 event pairs, 3046 based on Foata normal form. 2/7145 useless extension candidates. Maximal degree in co-relation 26175. Up to 6713 conditions per place. [2024-06-27 22:28:48,074 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 108 selfloop transitions, 30 changer transitions 0/146 dead transitions. [2024-06-27 22:28:48,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1280 flow [2024-06-27 22:28:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:28:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:28:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-27 22:28:48,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46467391304347827 [2024-06-27 22:28:48,076 INFO L175 Difference]: Start difference. First operand has 85 places, 104 transitions, 790 flow. Second operand 8 states and 171 transitions. [2024-06-27 22:28:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1280 flow [2024-06-27 22:28:48,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 146 transitions, 1168 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:28:48,108 INFO L231 Difference]: Finished difference. Result has 91 places, 119 transitions, 904 flow [2024-06-27 22:28:48,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=904, PETRI_PLACES=91, PETRI_TRANSITIONS=119} [2024-06-27 22:28:48,109 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2024-06-27 22:28:48,109 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 119 transitions, 904 flow [2024-06-27 22:28:48,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:28:48,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:48,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:48,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:28:48,110 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:48,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1850678760, now seen corresponding path program 1 times [2024-06-27 22:28:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107727756] [2024-06-27 22:28:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107727756] [2024-06-27 22:28:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107727756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:28:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62590631] [2024-06-27 22:28:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:28:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:28:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:28:48,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:48,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 119 transitions, 904 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:48,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:48,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:49,993 INFO L124 PetriNetUnfolderBase]: 5556/8774 cut-off events. [2024-06-27 22:28:49,994 INFO L125 PetriNetUnfolderBase]: For 38280/38292 co-relation queries the response was YES. [2024-06-27 22:28:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32896 conditions, 8774 events. 5556/8774 cut-off events. For 38280/38292 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 55642 event pairs, 2515 based on Foata normal form. 14/8254 useless extension candidates. Maximal degree in co-relation 32859. Up to 7788 conditions per place. [2024-06-27 22:28:50,055 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 120 selfloop transitions, 44 changer transitions 0/173 dead transitions. [2024-06-27 22:28:50,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 173 transitions, 1461 flow [2024-06-27 22:28:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:28:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:28:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 22:28:50,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 22:28:50,057 INFO L175 Difference]: Start difference. First operand has 91 places, 119 transitions, 904 flow. Second operand 8 states and 188 transitions. [2024-06-27 22:28:50,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 173 transitions, 1461 flow [2024-06-27 22:28:50,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 173 transitions, 1381 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:28:50,081 INFO L231 Difference]: Finished difference. Result has 97 places, 137 transitions, 1071 flow [2024-06-27 22:28:50,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1071, PETRI_PLACES=97, PETRI_TRANSITIONS=137} [2024-06-27 22:28:50,082 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2024-06-27 22:28:50,082 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 137 transitions, 1071 flow [2024-06-27 22:28:50,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:50,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:50,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:50,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:28:50,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:50,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1570871738, now seen corresponding path program 2 times [2024-06-27 22:28:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:50,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034649570] [2024-06-27 22:28:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034649570] [2024-06-27 22:28:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034649570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:50,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:50,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:28:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442812873] [2024-06-27 22:28:50,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:50,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:28:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:28:50,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:28:50,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:50,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 137 transitions, 1071 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:50,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:50,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:50,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:52,202 INFO L124 PetriNetUnfolderBase]: 5693/8953 cut-off events. [2024-06-27 22:28:52,202 INFO L125 PetriNetUnfolderBase]: For 49181/49195 co-relation queries the response was YES. [2024-06-27 22:28:52,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36143 conditions, 8953 events. 5693/8953 cut-off events. For 49181/49195 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 56247 event pairs, 2587 based on Foata normal form. 16/8435 useless extension candidates. Maximal degree in co-relation 36104. Up to 7934 conditions per place. [2024-06-27 22:28:52,265 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 129 selfloop transitions, 65 changer transitions 0/203 dead transitions. [2024-06-27 22:28:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 1882 flow [2024-06-27 22:28:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:28:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:28:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:28:52,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-27 22:28:52,268 INFO L175 Difference]: Start difference. First operand has 97 places, 137 transitions, 1071 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:28:52,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 1882 flow [2024-06-27 22:28:52,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 203 transitions, 1743 flow, removed 64 selfloop flow, removed 2 redundant places. [2024-06-27 22:28:52,326 INFO L231 Difference]: Finished difference. Result has 106 places, 168 transitions, 1481 flow [2024-06-27 22:28:52,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1481, PETRI_PLACES=106, PETRI_TRANSITIONS=168} [2024-06-27 22:28:52,327 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2024-06-27 22:28:52,327 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 168 transitions, 1481 flow [2024-06-27 22:28:52,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:52,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:52,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:52,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:28:52,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:52,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1570992638, now seen corresponding path program 3 times [2024-06-27 22:28:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:52,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604875732] [2024-06-27 22:28:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604875732] [2024-06-27 22:28:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604875732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:28:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196711466] [2024-06-27 22:28:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:28:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:28:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:28:53,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:53,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 168 transitions, 1481 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:53,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:53,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:53,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:54,380 INFO L124 PetriNetUnfolderBase]: 5708/8985 cut-off events. [2024-06-27 22:28:54,380 INFO L125 PetriNetUnfolderBase]: For 59223/59227 co-relation queries the response was YES. [2024-06-27 22:28:54,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38861 conditions, 8985 events. 5708/8985 cut-off events. For 59223/59227 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 56499 event pairs, 2547 based on Foata normal form. 6/8456 useless extension candidates. Maximal degree in co-relation 38817. Up to 7879 conditions per place. [2024-06-27 22:28:54,466 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 126 selfloop transitions, 82 changer transitions 0/217 dead transitions. [2024-06-27 22:28:54,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 217 transitions, 2239 flow [2024-06-27 22:28:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:28:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:28:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 22:28:54,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244565217391305 [2024-06-27 22:28:54,468 INFO L175 Difference]: Start difference. First operand has 106 places, 168 transitions, 1481 flow. Second operand 8 states and 193 transitions. [2024-06-27 22:28:54,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 217 transitions, 2239 flow [2024-06-27 22:28:54,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 217 transitions, 2119 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:28:54,508 INFO L231 Difference]: Finished difference. Result has 112 places, 180 transitions, 1756 flow [2024-06-27 22:28:54,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1756, PETRI_PLACES=112, PETRI_TRANSITIONS=180} [2024-06-27 22:28:54,509 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2024-06-27 22:28:54,509 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 180 transitions, 1756 flow [2024-06-27 22:28:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:54,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:54,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:54,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:28:54,510 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:54,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1935681042, now seen corresponding path program 4 times [2024-06-27 22:28:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401538539] [2024-06-27 22:28:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:55,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:55,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401538539] [2024-06-27 22:28:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401538539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:55,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:28:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710699116] [2024-06-27 22:28:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:55,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:28:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:28:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:28:55,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:55,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 180 transitions, 1756 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:55,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:55,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:55,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:56,959 INFO L124 PetriNetUnfolderBase]: 5876/9238 cut-off events. [2024-06-27 22:28:56,959 INFO L125 PetriNetUnfolderBase]: For 74129/74135 co-relation queries the response was YES. [2024-06-27 22:28:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43089 conditions, 9238 events. 5876/9238 cut-off events. For 74129/74135 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 58157 event pairs, 2392 based on Foata normal form. 6/8701 useless extension candidates. Maximal degree in co-relation 43043. Up to 8138 conditions per place. [2024-06-27 22:28:57,031 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 153 selfloop transitions, 88 changer transitions 0/250 dead transitions. [2024-06-27 22:28:57,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 250 transitions, 2809 flow [2024-06-27 22:28:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:28:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:28:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-27 22:28:57,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-06-27 22:28:57,034 INFO L175 Difference]: Start difference. First operand has 112 places, 180 transitions, 1756 flow. Second operand 7 states and 170 transitions. [2024-06-27 22:28:57,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 250 transitions, 2809 flow [2024-06-27 22:28:57,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 250 transitions, 2599 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-27 22:28:57,112 INFO L231 Difference]: Finished difference. Result has 116 places, 221 transitions, 2320 flow [2024-06-27 22:28:57,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2320, PETRI_PLACES=116, PETRI_TRANSITIONS=221} [2024-06-27 22:28:57,113 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2024-06-27 22:28:57,113 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 221 transitions, 2320 flow [2024-06-27 22:28:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:57,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:57,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:57,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:28:57,114 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:57,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1935801942, now seen corresponding path program 5 times [2024-06-27 22:28:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430803168] [2024-06-27 22:28:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:28:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:28:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:28:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430803168] [2024-06-27 22:28:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430803168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:28:58,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:28:58,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:28:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470248860] [2024-06-27 22:28:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:28:58,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:28:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:28:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:28:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:28:58,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:28:58,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 221 transitions, 2320 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:58,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:28:58,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:28:58,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:28:59,363 INFO L124 PetriNetUnfolderBase]: 5963/9378 cut-off events. [2024-06-27 22:28:59,363 INFO L125 PetriNetUnfolderBase]: For 84116/84122 co-relation queries the response was YES. [2024-06-27 22:28:59,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45384 conditions, 9378 events. 5963/9378 cut-off events. For 84116/84122 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 59045 event pairs, 2376 based on Foata normal form. 6/8840 useless extension candidates. Maximal degree in co-relation 45334. Up to 8183 conditions per place. [2024-06-27 22:28:59,435 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 159 selfloop transitions, 108 changer transitions 0/276 dead transitions. [2024-06-27 22:28:59,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 276 transitions, 3326 flow [2024-06-27 22:28:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:28:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:28:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 22:28:59,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:28:59,437 INFO L175 Difference]: Start difference. First operand has 116 places, 221 transitions, 2320 flow. Second operand 8 states and 184 transitions. [2024-06-27 22:28:59,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 276 transitions, 3326 flow [2024-06-27 22:28:59,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 276 transitions, 3221 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:28:59,518 INFO L231 Difference]: Finished difference. Result has 124 places, 245 transitions, 2844 flow [2024-06-27 22:28:59,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2844, PETRI_PLACES=124, PETRI_TRANSITIONS=245} [2024-06-27 22:28:59,518 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 72 predicate places. [2024-06-27 22:28:59,519 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 245 transitions, 2844 flow [2024-06-27 22:28:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:28:59,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:28:59,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:28:59,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:28:59,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:28:59,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:28:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash -468119382, now seen corresponding path program 6 times [2024-06-27 22:28:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:28:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860066250] [2024-06-27 22:28:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:28:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:28:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860066250] [2024-06-27 22:29:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860066250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:29:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201383874] [2024-06-27 22:29:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:00,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:29:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:29:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:29:00,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 245 transitions, 2844 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:29:00,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:00,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:00,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:01,788 INFO L124 PetriNetUnfolderBase]: 6082/9551 cut-off events. [2024-06-27 22:29:01,789 INFO L125 PetriNetUnfolderBase]: For 104879/104885 co-relation queries the response was YES. [2024-06-27 22:29:01,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49660 conditions, 9551 events. 6082/9551 cut-off events. For 104879/104885 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 60188 event pairs, 2076 based on Foata normal form. 10/9010 useless extension candidates. Maximal degree in co-relation 49606. Up to 7774 conditions per place. [2024-06-27 22:29:01,862 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 173 selfloop transitions, 116 changer transitions 0/298 dead transitions. [2024-06-27 22:29:01,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 3982 flow [2024-06-27 22:29:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:29:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:29:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 22:29:01,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5527950310559007 [2024-06-27 22:29:01,865 INFO L175 Difference]: Start difference. First operand has 124 places, 245 transitions, 2844 flow. Second operand 7 states and 178 transitions. [2024-06-27 22:29:01,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 3982 flow [2024-06-27 22:29:01,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 298 transitions, 3875 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:01,982 INFO L231 Difference]: Finished difference. Result has 130 places, 261 transitions, 3312 flow [2024-06-27 22:29:01,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3312, PETRI_PLACES=130, PETRI_TRANSITIONS=261} [2024-06-27 22:29:01,984 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 78 predicate places. [2024-06-27 22:29:01,985 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 261 transitions, 3312 flow [2024-06-27 22:29:01,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-27 22:29:01,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:01,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:01,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:29:01,985 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -480381356, now seen corresponding path program 1 times [2024-06-27 22:29:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625599837] [2024-06-27 22:29:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625599837] [2024-06-27 22:29:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625599837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:29:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043283509] [2024-06-27 22:29:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:02,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:29:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:29:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:29:02,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2024-06-27 22:29:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 261 transitions, 3312 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2024-06-27 22:29:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:02,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([354] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_69 256) 0))))) (and (= v_~x$w_buff1_used~0_68 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_69)) (= (ite .cse2 0 v_~x$w_buff0_used~0_84) v_~x$w_buff0_used~0_83) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_68 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_24)) (= v_~x$r_buff0_thd2~0_28 (ite .cse1 0 v_~x$r_buff0_thd2~0_29)) (= v_~x~0_31 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_26 v_~x~0_32)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][94], [Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 190#(and (= 2 ~x$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 132#(and (= ~x$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= |#ghost~multithreaded| 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), Black: 131#(and (= ~x$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= |#ghost~multithreaded| 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), Black: 133#(and (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= 2 ~x~0) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0)), 94#true, Black: 80#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 205#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))), Black: 206#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 147#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 86#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 82#true, 126#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 220#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 221#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 219#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 14#L783true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 16#L744true, Black: 99#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 160#(and (<= 0 (div ~x$w_buff0_used~0 256)) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x~0 1))) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 215#true, 171#true, 227#true, 200#true, Black: 111#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~x$w_buff0_used~0 256)) (= 1 ~x$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, 141#true, P1Thread1of1ForFork2InUse, Black: 177#(and (= ~x$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 176#(and (= ~x$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), P0Thread1of1ForFork0InUse, 28#L830true, 12#L793true, Black: 122#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd2~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 22:29:02,477 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:29:02,478 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:29:02,478 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:29:02,478 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:29:02,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([354] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_69 256) 0))))) (and (= v_~x$w_buff1_used~0_68 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_69)) (= (ite .cse2 0 v_~x$w_buff0_used~0_84) v_~x$w_buff0_used~0_83) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_68 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_24)) (= v_~x$r_buff0_thd2~0_28 (ite .cse1 0 v_~x$r_buff0_thd2~0_29)) (= v_~x~0_31 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_26 v_~x~0_32)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][94], [30#L754true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 190#(and (= 2 ~x$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 132#(and (= ~x$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= |#ghost~multithreaded| 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), Black: 131#(and (= ~x$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= |#ghost~multithreaded| 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), Black: 133#(and (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= 2 ~x~0) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0)), 94#true, Black: 80#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 205#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))), Black: 206#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 147#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 86#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 82#true, 126#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 220#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 221#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 219#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$w_buff0_used~0 256)) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 14#L783true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 99#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 160#(and (<= 0 (div ~x$w_buff0_used~0 256)) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x~0 1))) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 215#true, 171#true, 227#true, P2Thread1of1ForFork1InUse, 200#true, Black: 111#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~x$w_buff0_used~0 256)) (= 1 ~x$r_buff0_thd2~0)), 141#true, P1Thread1of1ForFork2InUse, Black: 177#(and (= ~x$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 176#(and (= ~x$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 28#L830true, P0Thread1of1ForFork0InUse, 12#L793true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 122#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd2~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 22:29:02,508 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 22:29:02,508 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:29:02,508 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:29:02,508 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:29:02,757 INFO L124 PetriNetUnfolderBase]: 2572/4793 cut-off events. [2024-06-27 22:29:02,758 INFO L125 PetriNetUnfolderBase]: For 57675/58368 co-relation queries the response was YES. [2024-06-27 22:29:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 4793 events. 2572/4793 cut-off events. For 57675/58368 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 34306 event pairs, 785 based on Foata normal form. 111/4583 useless extension candidates. Maximal degree in co-relation 25880. Up to 2805 conditions per place. [2024-06-27 22:29:02,802 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 141 selfloop transitions, 23 changer transitions 0/273 dead transitions. [2024-06-27 22:29:02,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 273 transitions, 3704 flow [2024-06-27 22:29:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:29:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:29:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-06-27 22:29:02,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2024-06-27 22:29:02,804 INFO L175 Difference]: Start difference. First operand has 130 places, 261 transitions, 3312 flow. Second operand 3 states and 104 transitions. [2024-06-27 22:29:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 273 transitions, 3704 flow [2024-06-27 22:29:02,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 273 transitions, 3545 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-06-27 22:29:02,867 INFO L231 Difference]: Finished difference. Result has 129 places, 260 transitions, 3189 flow [2024-06-27 22:29:02,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3189, PETRI_PLACES=129, PETRI_TRANSITIONS=260} [2024-06-27 22:29:02,868 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 77 predicate places. [2024-06-27 22:29:02,868 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 260 transitions, 3189 flow [2024-06-27 22:29:02,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:02,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:02,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:29:02,869 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:02,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2114133069, now seen corresponding path program 1 times [2024-06-27 22:29:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:02,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523660284] [2024-06-27 22:29:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523660284] [2024-06-27 22:29:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523660284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558222662] [2024-06-27 22:29:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:04,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:04,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 260 transitions, 3189 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:04,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:04,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:05,869 INFO L124 PetriNetUnfolderBase]: 5814/9002 cut-off events. [2024-06-27 22:29:05,870 INFO L125 PetriNetUnfolderBase]: For 114199/114199 co-relation queries the response was YES. [2024-06-27 22:29:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49382 conditions, 9002 events. 5814/9002 cut-off events. For 114199/114199 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 53144 event pairs, 2587 based on Foata normal form. 4/8786 useless extension candidates. Maximal degree in co-relation 49324. Up to 8176 conditions per place. [2024-06-27 22:29:05,941 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 257 selfloop transitions, 33 changer transitions 1/298 dead transitions. [2024-06-27 22:29:05,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 298 transitions, 3987 flow [2024-06-27 22:29:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-27 22:29:05,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:29:05,943 INFO L175 Difference]: Start difference. First operand has 129 places, 260 transitions, 3189 flow. Second operand 9 states and 184 transitions. [2024-06-27 22:29:05,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 298 transitions, 3987 flow [2024-06-27 22:29:06,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 298 transitions, 3941 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:29:06,062 INFO L231 Difference]: Finished difference. Result has 136 places, 262 transitions, 3279 flow [2024-06-27 22:29:06,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3279, PETRI_PLACES=136, PETRI_TRANSITIONS=262} [2024-06-27 22:29:06,063 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 84 predicate places. [2024-06-27 22:29:06,063 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 262 transitions, 3279 flow [2024-06-27 22:29:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:06,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:06,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:06,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:29:06,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:06,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1782770739, now seen corresponding path program 1 times [2024-06-27 22:29:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207578213] [2024-06-27 22:29:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207578213] [2024-06-27 22:29:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207578213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:06,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:29:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115892308] [2024-06-27 22:29:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:06,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:29:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:06,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:29:06,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:29:06,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:06,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 262 transitions, 3279 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-27 22:29:06,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:06,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:06,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:07,913 INFO L124 PetriNetUnfolderBase]: 4536/7202 cut-off events. [2024-06-27 22:29:07,914 INFO L125 PetriNetUnfolderBase]: For 95437/95437 co-relation queries the response was YES. [2024-06-27 22:29:07,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41354 conditions, 7202 events. 4536/7202 cut-off events. For 95437/95437 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 42966 event pairs, 1934 based on Foata normal form. 2/7005 useless extension candidates. Maximal degree in co-relation 41294. Up to 6437 conditions per place. [2024-06-27 22:29:07,972 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 257 selfloop transitions, 16 changer transitions 0/281 dead transitions. [2024-06-27 22:29:07,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 281 transitions, 3931 flow [2024-06-27 22:29:07,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:29:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:29:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 22:29:07,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49130434782608695 [2024-06-27 22:29:07,974 INFO L175 Difference]: Start difference. First operand has 136 places, 262 transitions, 3279 flow. Second operand 5 states and 113 transitions. [2024-06-27 22:29:07,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 281 transitions, 3931 flow [2024-06-27 22:29:08,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 281 transitions, 3837 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:29:08,071 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 3257 flow [2024-06-27 22:29:08,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3257, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2024-06-27 22:29:08,071 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2024-06-27 22:29:08,072 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 3257 flow [2024-06-27 22:29:08,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-27 22:29:08,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:08,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:29:08,072 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:08,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1630115345, now seen corresponding path program 1 times [2024-06-27 22:29:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836206510] [2024-06-27 22:29:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:08,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:08,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836206510] [2024-06-27 22:29:08,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836206510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:08,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:08,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:29:08,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048344006] [2024-06-27 22:29:08,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:08,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:29:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:29:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:29:08,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-27 22:29:08,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 3257 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-27 22:29:08,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:08,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-27 22:29:08,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:09,997 INFO L124 PetriNetUnfolderBase]: 4597/7457 cut-off events. [2024-06-27 22:29:09,998 INFO L125 PetriNetUnfolderBase]: For 112211/112344 co-relation queries the response was YES. [2024-06-27 22:29:10,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44315 conditions, 7457 events. 4597/7457 cut-off events. For 112211/112344 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 46784 event pairs, 1612 based on Foata normal form. 80/7303 useless extension candidates. Maximal degree in co-relation 44253. Up to 6208 conditions per place. [2024-06-27 22:29:10,060 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 172 selfloop transitions, 133 changer transitions 0/331 dead transitions. [2024-06-27 22:29:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 331 transitions, 4535 flow [2024-06-27 22:29:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:29:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:29:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 22:29:10,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 22:29:10,062 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 3257 flow. Second operand 7 states and 168 transitions. [2024-06-27 22:29:10,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 331 transitions, 4535 flow [2024-06-27 22:29:10,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 331 transitions, 4502 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:10,160 INFO L231 Difference]: Finished difference. Result has 139 places, 300 transitions, 4242 flow [2024-06-27 22:29:10,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4242, PETRI_PLACES=139, PETRI_TRANSITIONS=300} [2024-06-27 22:29:10,161 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2024-06-27 22:29:10,161 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 300 transitions, 4242 flow [2024-06-27 22:29:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-27 22:29:10,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:10,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:10,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:29:10,162 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:10,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1596922025, now seen corresponding path program 2 times [2024-06-27 22:29:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183079402] [2024-06-27 22:29:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183079402] [2024-06-27 22:29:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183079402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:10,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558125827] [2024-06-27 22:29:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:10,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:11,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:11,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 300 transitions, 4242 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:11,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:11,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:11,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:12,434 INFO L124 PetriNetUnfolderBase]: 4955/7920 cut-off events. [2024-06-27 22:29:12,435 INFO L125 PetriNetUnfolderBase]: For 134095/134101 co-relation queries the response was YES. [2024-06-27 22:29:12,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49959 conditions, 7920 events. 4955/7920 cut-off events. For 134095/134101 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 48910 event pairs, 1876 based on Foata normal form. 9/7707 useless extension candidates. Maximal degree in co-relation 49894. Up to 6752 conditions per place. [2024-06-27 22:29:12,504 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 217 selfloop transitions, 142 changer transitions 0/368 dead transitions. [2024-06-27 22:29:12,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 368 transitions, 5714 flow [2024-06-27 22:29:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:29:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:29:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 22:29:12,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135869565217391 [2024-06-27 22:29:12,509 INFO L175 Difference]: Start difference. First operand has 139 places, 300 transitions, 4242 flow. Second operand 8 states and 189 transitions. [2024-06-27 22:29:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 368 transitions, 5714 flow [2024-06-27 22:29:12,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 368 transitions, 5488 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:12,673 INFO L231 Difference]: Finished difference. Result has 145 places, 333 transitions, 5037 flow [2024-06-27 22:29:12,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5037, PETRI_PLACES=145, PETRI_TRANSITIONS=333} [2024-06-27 22:29:12,674 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 93 predicate places. [2024-06-27 22:29:12,675 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 333 transitions, 5037 flow [2024-06-27 22:29:12,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:12,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:12,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:29:12,675 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:12,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1452293129, now seen corresponding path program 3 times [2024-06-27 22:29:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420165562] [2024-06-27 22:29:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:13,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:13,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420165562] [2024-06-27 22:29:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420165562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:13,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101991747] [2024-06-27 22:29:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:13,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:13,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:13,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:13,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:13,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 333 transitions, 5037 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:13,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:13,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:13,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:15,132 INFO L124 PetriNetUnfolderBase]: 5086/8073 cut-off events. [2024-06-27 22:29:15,133 INFO L125 PetriNetUnfolderBase]: For 140630/140638 co-relation queries the response was YES. [2024-06-27 22:29:15,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52116 conditions, 8073 events. 5086/8073 cut-off events. For 140630/140638 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 49443 event pairs, 1681 based on Foata normal form. 11/7863 useless extension candidates. Maximal degree in co-relation 52049. Up to 6895 conditions per place. [2024-06-27 22:29:15,214 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 249 selfloop transitions, 172 changer transitions 0/430 dead transitions. [2024-06-27 22:29:15,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 430 transitions, 7237 flow [2024-06-27 22:29:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:29:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:29:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:29:15,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-27 22:29:15,216 INFO L175 Difference]: Start difference. First operand has 145 places, 333 transitions, 5037 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:29:15,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 430 transitions, 7237 flow [2024-06-27 22:29:15,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 430 transitions, 6767 flow, removed 155 selfloop flow, removed 4 redundant places. [2024-06-27 22:29:15,476 INFO L231 Difference]: Finished difference. Result has 149 places, 389 transitions, 6219 flow [2024-06-27 22:29:15,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4749, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6219, PETRI_PLACES=149, PETRI_TRANSITIONS=389} [2024-06-27 22:29:15,476 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 97 predicate places. [2024-06-27 22:29:15,476 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 389 transitions, 6219 flow [2024-06-27 22:29:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:15,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:15,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:15,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:29:15,478 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:15,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1675191723, now seen corresponding path program 1 times [2024-06-27 22:29:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929850592] [2024-06-27 22:29:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929850592] [2024-06-27 22:29:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929850592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972969288] [2024-06-27 22:29:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:16,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:16,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:16,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 389 transitions, 6219 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:16,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:16,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:16,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:18,298 INFO L124 PetriNetUnfolderBase]: 5813/8920 cut-off events. [2024-06-27 22:29:18,298 INFO L125 PetriNetUnfolderBase]: For 149110/149114 co-relation queries the response was YES. [2024-06-27 22:29:18,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56735 conditions, 8920 events. 5813/8920 cut-off events. For 149110/149114 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 51583 event pairs, 1710 based on Foata normal form. 10/8707 useless extension candidates. Maximal degree in co-relation 56668. Up to 7443 conditions per place. [2024-06-27 22:29:18,380 INFO L140 encePairwiseOnDemand]: 28/46 looper letters, 215 selfloop transitions, 296 changer transitions 0/518 dead transitions. [2024-06-27 22:29:18,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 518 transitions, 8896 flow [2024-06-27 22:29:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-06-27 22:29:18,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:29:18,382 INFO L175 Difference]: Start difference. First operand has 149 places, 389 transitions, 6219 flow. Second operand 9 states and 207 transitions. [2024-06-27 22:29:18,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 518 transitions, 8896 flow [2024-06-27 22:29:18,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 518 transitions, 8595 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-27 22:29:18,684 INFO L231 Difference]: Finished difference. Result has 155 places, 471 transitions, 8060 flow [2024-06-27 22:29:18,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5966, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8060, PETRI_PLACES=155, PETRI_TRANSITIONS=471} [2024-06-27 22:29:18,684 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 103 predicate places. [2024-06-27 22:29:18,685 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 471 transitions, 8060 flow [2024-06-27 22:29:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:18,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:18,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:18,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:29:18,685 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:18,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1787405695, now seen corresponding path program 4 times [2024-06-27 22:29:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059286928] [2024-06-27 22:29:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059286928] [2024-06-27 22:29:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059286928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:19,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398679216] [2024-06-27 22:29:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:19,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:19,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:19,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 471 transitions, 8060 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:19,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:19,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:21,331 INFO L124 PetriNetUnfolderBase]: 5435/8521 cut-off events. [2024-06-27 22:29:21,331 INFO L125 PetriNetUnfolderBase]: For 164346/164408 co-relation queries the response was YES. [2024-06-27 22:29:21,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57427 conditions, 8521 events. 5435/8521 cut-off events. For 164346/164408 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 51249 event pairs, 1455 based on Foata normal form. 15/8303 useless extension candidates. Maximal degree in co-relation 57358. Up to 7244 conditions per place. [2024-06-27 22:29:21,416 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 319 selfloop transitions, 204 changer transitions 0/533 dead transitions. [2024-06-27 22:29:21,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 533 transitions, 9858 flow [2024-06-27 22:29:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:29:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:29:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 22:29:21,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 22:29:21,418 INFO L175 Difference]: Start difference. First operand has 155 places, 471 transitions, 8060 flow. Second operand 7 states and 168 transitions. [2024-06-27 22:29:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 533 transitions, 9858 flow [2024-06-27 22:29:21,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 533 transitions, 9409 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-27 22:29:21,900 INFO L231 Difference]: Finished difference. Result has 157 places, 500 transitions, 8773 flow [2024-06-27 22:29:21,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7633, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8773, PETRI_PLACES=157, PETRI_TRANSITIONS=500} [2024-06-27 22:29:21,901 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 105 predicate places. [2024-06-27 22:29:21,901 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 500 transitions, 8773 flow [2024-06-27 22:29:21,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:21,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:21,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:21,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:29:21,901 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:21,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1783566655, now seen corresponding path program 5 times [2024-06-27 22:29:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710940181] [2024-06-27 22:29:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710940181] [2024-06-27 22:29:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710940181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97493600] [2024-06-27 22:29:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:23,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:23,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:23,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 500 transitions, 8773 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:23,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:23,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:23,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:24,810 INFO L124 PetriNetUnfolderBase]: 5464/8560 cut-off events. [2024-06-27 22:29:24,810 INFO L125 PetriNetUnfolderBase]: For 177944/178006 co-relation queries the response was YES. [2024-06-27 22:29:24,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58525 conditions, 8560 events. 5464/8560 cut-off events. For 177944/178006 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 51451 event pairs, 1461 based on Foata normal form. 34/8360 useless extension candidates. Maximal degree in co-relation 58455. Up to 7196 conditions per place. [2024-06-27 22:29:24,894 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 289 selfloop transitions, 243 changer transitions 0/542 dead transitions. [2024-06-27 22:29:24,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 542 transitions, 10228 flow [2024-06-27 22:29:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:29:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:29:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-06-27 22:29:24,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49184782608695654 [2024-06-27 22:29:24,896 INFO L175 Difference]: Start difference. First operand has 157 places, 500 transitions, 8773 flow. Second operand 8 states and 181 transitions. [2024-06-27 22:29:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 542 transitions, 10228 flow [2024-06-27 22:29:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 542 transitions, 9918 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:25,212 INFO L231 Difference]: Finished difference. Result has 162 places, 509 transitions, 9217 flow [2024-06-27 22:29:25,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8463, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9217, PETRI_PLACES=162, PETRI_TRANSITIONS=509} [2024-06-27 22:29:25,214 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 110 predicate places. [2024-06-27 22:29:25,214 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 509 transitions, 9217 flow [2024-06-27 22:29:25,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:25,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:25,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:25,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:29:25,215 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:25,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash -86396647, now seen corresponding path program 2 times [2024-06-27 22:29:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:25,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311204359] [2024-06-27 22:29:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311204359] [2024-06-27 22:29:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311204359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:26,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258398652] [2024-06-27 22:29:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:26,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:26,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:26,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 509 transitions, 9217 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:26,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:26,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:26,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:28,281 INFO L124 PetriNetUnfolderBase]: 6034/9220 cut-off events. [2024-06-27 22:29:28,282 INFO L125 PetriNetUnfolderBase]: For 188745/188751 co-relation queries the response was YES. [2024-06-27 22:29:28,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62581 conditions, 9220 events. 6034/9220 cut-off events. For 188745/188751 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 53207 event pairs, 1555 based on Foata normal form. 10/8996 useless extension candidates. Maximal degree in co-relation 62509. Up to 7896 conditions per place. [2024-06-27 22:29:28,377 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 325 selfloop transitions, 251 changer transitions 0/583 dead transitions. [2024-06-27 22:29:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 583 transitions, 11107 flow [2024-06-27 22:29:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 22:29:28,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 22:29:28,379 INFO L175 Difference]: Start difference. First operand has 162 places, 509 transitions, 9217 flow. Second operand 9 states and 198 transitions. [2024-06-27 22:29:28,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 583 transitions, 11107 flow [2024-06-27 22:29:28,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 583 transitions, 10526 flow, removed 71 selfloop flow, removed 5 redundant places. [2024-06-27 22:29:28,787 INFO L231 Difference]: Finished difference. Result has 167 places, 538 transitions, 9715 flow [2024-06-27 22:29:28,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8665, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9715, PETRI_PLACES=167, PETRI_TRANSITIONS=538} [2024-06-27 22:29:28,788 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 115 predicate places. [2024-06-27 22:29:28,788 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 538 transitions, 9715 flow [2024-06-27 22:29:28,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:28,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:28,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:29:28,789 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:28,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1105034833, now seen corresponding path program 3 times [2024-06-27 22:29:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757253232] [2024-06-27 22:29:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757253232] [2024-06-27 22:29:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757253232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:29,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026040436] [2024-06-27 22:29:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:30,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:30,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 538 transitions, 9715 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:30,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:30,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:30,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:31,970 INFO L124 PetriNetUnfolderBase]: 6151/9385 cut-off events. [2024-06-27 22:29:31,970 INFO L125 PetriNetUnfolderBase]: For 197467/197473 co-relation queries the response was YES. [2024-06-27 22:29:32,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64625 conditions, 9385 events. 6151/9385 cut-off events. For 197467/197473 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 54102 event pairs, 1565 based on Foata normal form. 10/9154 useless extension candidates. Maximal degree in co-relation 64551. Up to 7764 conditions per place. [2024-06-27 22:29:32,046 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 225 selfloop transitions, 368 changer transitions 0/600 dead transitions. [2024-06-27 22:29:32,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 600 transitions, 11420 flow [2024-06-27 22:29:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 22:29:32,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 22:29:32,048 INFO L175 Difference]: Start difference. First operand has 167 places, 538 transitions, 9715 flow. Second operand 9 states and 198 transitions. [2024-06-27 22:29:32,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 600 transitions, 11420 flow [2024-06-27 22:29:32,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 600 transitions, 11056 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 22:29:32,397 INFO L231 Difference]: Finished difference. Result has 172 places, 563 transitions, 10448 flow [2024-06-27 22:29:32,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9351, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10448, PETRI_PLACES=172, PETRI_TRANSITIONS=563} [2024-06-27 22:29:32,397 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 120 predicate places. [2024-06-27 22:29:32,398 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 563 transitions, 10448 flow [2024-06-27 22:29:32,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:32,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:32,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:32,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:29:32,398 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:32,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1105027889, now seen corresponding path program 6 times [2024-06-27 22:29:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758067446] [2024-06-27 22:29:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758067446] [2024-06-27 22:29:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758067446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:33,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:33,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:33,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432035645] [2024-06-27 22:29:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:33,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:33,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:33,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:33,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 563 transitions, 10448 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:33,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:33,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:33,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:35,472 INFO L124 PetriNetUnfolderBase]: 5754/8954 cut-off events. [2024-06-27 22:29:35,472 INFO L125 PetriNetUnfolderBase]: For 216790/216804 co-relation queries the response was YES. [2024-06-27 22:29:35,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64304 conditions, 8954 events. 5754/8954 cut-off events. For 216790/216804 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 53484 event pairs, 1447 based on Foata normal form. 16/8729 useless extension candidates. Maximal degree in co-relation 64228. Up to 7206 conditions per place. [2024-06-27 22:29:35,559 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 191 selfloop transitions, 395 changer transitions 0/599 dead transitions. [2024-06-27 22:29:35,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 599 transitions, 11994 flow [2024-06-27 22:29:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:29:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:29:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-27 22:29:35,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2024-06-27 22:29:35,561 INFO L175 Difference]: Start difference. First operand has 172 places, 563 transitions, 10448 flow. Second operand 8 states and 179 transitions. [2024-06-27 22:29:35,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 599 transitions, 11994 flow [2024-06-27 22:29:35,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 599 transitions, 11471 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-27 22:29:35,981 INFO L231 Difference]: Finished difference. Result has 177 places, 573 transitions, 11331 flow [2024-06-27 22:29:35,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9929, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11331, PETRI_PLACES=177, PETRI_TRANSITIONS=573} [2024-06-27 22:29:35,982 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 125 predicate places. [2024-06-27 22:29:35,982 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 573 transitions, 11331 flow [2024-06-27 22:29:35,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:35,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:35,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:35,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:29:35,982 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:35,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1113309043, now seen corresponding path program 4 times [2024-06-27 22:29:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251717420] [2024-06-27 22:29:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251717420] [2024-06-27 22:29:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251717420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:37,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:37,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:37,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240433110] [2024-06-27 22:29:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:37,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:37,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 573 transitions, 11331 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:37,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:37,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:37,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:39,121 INFO L124 PetriNetUnfolderBase]: 6193/9442 cut-off events. [2024-06-27 22:29:39,122 INFO L125 PetriNetUnfolderBase]: For 221426/221432 co-relation queries the response was YES. [2024-06-27 22:29:39,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69073 conditions, 9442 events. 6193/9442 cut-off events. For 221426/221432 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 54427 event pairs, 1541 based on Foata normal form. 10/9211 useless extension candidates. Maximal degree in co-relation 68994. Up to 7821 conditions per place. [2024-06-27 22:29:39,222 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 245 selfloop transitions, 378 changer transitions 0/630 dead transitions. [2024-06-27 22:29:39,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 630 transitions, 13087 flow [2024-06-27 22:29:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 22:29:39,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 22:29:39,223 INFO L175 Difference]: Start difference. First operand has 177 places, 573 transitions, 11331 flow. Second operand 9 states and 198 transitions. [2024-06-27 22:29:39,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 630 transitions, 13087 flow [2024-06-27 22:29:39,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 630 transitions, 12806 flow, removed 86 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:39,742 INFO L231 Difference]: Finished difference. Result has 183 places, 586 transitions, 12032 flow [2024-06-27 22:29:39,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11072, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12032, PETRI_PLACES=183, PETRI_TRANSITIONS=586} [2024-06-27 22:29:39,743 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 131 predicate places. [2024-06-27 22:29:39,743 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 586 transitions, 12032 flow [2024-06-27 22:29:39,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:39,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:39,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:39,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:29:39,744 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:39,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1113605713, now seen corresponding path program 5 times [2024-06-27 22:29:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263885198] [2024-06-27 22:29:39,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263885198] [2024-06-27 22:29:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263885198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:29:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889323592] [2024-06-27 22:29:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:40,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:29:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:29:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:29:41,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:29:41,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 586 transitions, 12032 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:41,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:41,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:29:41,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:42,771 INFO L124 PetriNetUnfolderBase]: 6188/9434 cut-off events. [2024-06-27 22:29:42,772 INFO L125 PetriNetUnfolderBase]: For 223973/223979 co-relation queries the response was YES. [2024-06-27 22:29:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70396 conditions, 9434 events. 6188/9434 cut-off events. For 223973/223979 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54388 event pairs, 1533 based on Foata normal form. 6/9199 useless extension candidates. Maximal degree in co-relation 70315. Up to 7507 conditions per place. [2024-06-27 22:29:42,879 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 222 selfloop transitions, 404 changer transitions 0/633 dead transitions. [2024-06-27 22:29:42,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 633 transitions, 13683 flow [2024-06-27 22:29:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:29:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:29:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 22:29:42,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 22:29:42,893 INFO L175 Difference]: Start difference. First operand has 183 places, 586 transitions, 12032 flow. Second operand 8 states and 188 transitions. [2024-06-27 22:29:42,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 633 transitions, 13683 flow [2024-06-27 22:29:43,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 633 transitions, 13057 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 22:29:43,421 INFO L231 Difference]: Finished difference. Result has 186 places, 590 transitions, 12320 flow [2024-06-27 22:29:43,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11406, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12320, PETRI_PLACES=186, PETRI_TRANSITIONS=590} [2024-06-27 22:29:43,430 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 134 predicate places. [2024-06-27 22:29:43,430 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 590 transitions, 12320 flow [2024-06-27 22:29:43,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:43,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:43,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:43,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:29:43,431 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:43,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -732622865, now seen corresponding path program 1 times [2024-06-27 22:29:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455622870] [2024-06-27 22:29:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455622870] [2024-06-27 22:29:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455622870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237640084] [2024-06-27 22:29:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:44,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:44,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 590 transitions, 12320 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:44,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:44,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:46,258 INFO L124 PetriNetUnfolderBase]: 5897/9191 cut-off events. [2024-06-27 22:29:46,259 INFO L125 PetriNetUnfolderBase]: For 256012/256020 co-relation queries the response was YES. [2024-06-27 22:29:46,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70491 conditions, 9191 events. 5897/9191 cut-off events. For 256012/256020 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 55591 event pairs, 1901 based on Foata normal form. 12/8968 useless extension candidates. Maximal degree in co-relation 70409. Up to 7908 conditions per place. [2024-06-27 22:29:46,372 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 502 selfloop transitions, 136 changer transitions 0/651 dead transitions. [2024-06-27 22:29:46,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 651 transitions, 14123 flow [2024-06-27 22:29:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-06-27 22:29:46,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096618357487923 [2024-06-27 22:29:46,375 INFO L175 Difference]: Start difference. First operand has 186 places, 590 transitions, 12320 flow. Second operand 9 states and 211 transitions. [2024-06-27 22:29:46,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 651 transitions, 14123 flow [2024-06-27 22:29:46,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 651 transitions, 13264 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 22:29:46,868 INFO L231 Difference]: Finished difference. Result has 190 places, 606 transitions, 12125 flow [2024-06-27 22:29:46,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11477, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12125, PETRI_PLACES=190, PETRI_TRANSITIONS=606} [2024-06-27 22:29:46,869 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 138 predicate places. [2024-06-27 22:29:46,869 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 606 transitions, 12125 flow [2024-06-27 22:29:46,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:46,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:46,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:46,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:29:46,869 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:46,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1273046519, now seen corresponding path program 2 times [2024-06-27 22:29:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706870159] [2024-06-27 22:29:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706870159] [2024-06-27 22:29:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706870159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:29:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602196737] [2024-06-27 22:29:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:47,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:29:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:29:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:29:47,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:29:47,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 606 transitions, 12125 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:47,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:47,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:29:47,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:49,193 INFO L124 PetriNetUnfolderBase]: 5021/8305 cut-off events. [2024-06-27 22:29:49,194 INFO L125 PetriNetUnfolderBase]: For 248075/248248 co-relation queries the response was YES. [2024-06-27 22:29:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63919 conditions, 8305 events. 5021/8305 cut-off events. For 248075/248248 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 54462 event pairs, 971 based on Foata normal form. 104/8142 useless extension candidates. Maximal degree in co-relation 63835. Up to 5720 conditions per place. [2024-06-27 22:29:49,296 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 305 selfloop transitions, 235 changer transitions 0/657 dead transitions. [2024-06-27 22:29:49,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 657 transitions, 13760 flow [2024-06-27 22:29:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:29:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:29:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-06-27 22:29:49,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683229813664596 [2024-06-27 22:29:49,303 INFO L175 Difference]: Start difference. First operand has 190 places, 606 transitions, 12125 flow. Second operand 7 states and 183 transitions. [2024-06-27 22:29:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 657 transitions, 13760 flow [2024-06-27 22:29:49,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 657 transitions, 13383 flow, removed 124 selfloop flow, removed 4 redundant places. [2024-06-27 22:29:49,882 INFO L231 Difference]: Finished difference. Result has 195 places, 620 transitions, 12828 flow [2024-06-27 22:29:49,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11864, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12828, PETRI_PLACES=195, PETRI_TRANSITIONS=620} [2024-06-27 22:29:49,883 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 143 predicate places. [2024-06-27 22:29:49,883 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 620 transitions, 12828 flow [2024-06-27 22:29:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:49,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:49,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:49,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:29:49,884 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:49,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash -819937369, now seen corresponding path program 3 times [2024-06-27 22:29:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095858771] [2024-06-27 22:29:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095858771] [2024-06-27 22:29:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095858771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387021311] [2024-06-27 22:29:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:51,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:51,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 620 transitions, 12828 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:51,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:51,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:51,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:53,223 INFO L124 PetriNetUnfolderBase]: 6254/9735 cut-off events. [2024-06-27 22:29:53,223 INFO L125 PetriNetUnfolderBase]: For 298483/298501 co-relation queries the response was YES. [2024-06-27 22:29:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78272 conditions, 9735 events. 6254/9735 cut-off events. For 298483/298501 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 59136 event pairs, 1416 based on Foata normal form. 26/9541 useless extension candidates. Maximal degree in co-relation 78184. Up to 8140 conditions per place. [2024-06-27 22:29:53,361 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 458 selfloop transitions, 300 changer transitions 0/771 dead transitions. [2024-06-27 22:29:53,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 771 transitions, 17192 flow [2024-06-27 22:29:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:29:53,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 22:29:53,363 INFO L175 Difference]: Start difference. First operand has 195 places, 620 transitions, 12828 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:29:53,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 771 transitions, 17192 flow [2024-06-27 22:29:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 771 transitions, 16853 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 22:29:54,137 INFO L231 Difference]: Finished difference. Result has 201 places, 717 transitions, 16001 flow [2024-06-27 22:29:54,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12574, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16001, PETRI_PLACES=201, PETRI_TRANSITIONS=717} [2024-06-27 22:29:54,138 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 149 predicate places. [2024-06-27 22:29:54,138 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 717 transitions, 16001 flow [2024-06-27 22:29:54,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:54,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:54,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:54,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:29:54,139 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:54,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1064006471, now seen corresponding path program 4 times [2024-06-27 22:29:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741619071] [2024-06-27 22:29:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741619071] [2024-06-27 22:29:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741619071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825838988] [2024-06-27 22:29:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:55,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:55,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:55,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 717 transitions, 16001 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:55,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:57,490 INFO L124 PetriNetUnfolderBase]: 6501/10097 cut-off events. [2024-06-27 22:29:57,490 INFO L125 PetriNetUnfolderBase]: For 334839/334855 co-relation queries the response was YES. [2024-06-27 22:29:57,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82241 conditions, 10097 events. 6501/10097 cut-off events. For 334839/334855 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 61449 event pairs, 1530 based on Foata normal form. 20/9896 useless extension candidates. Maximal degree in co-relation 82153. Up to 8637 conditions per place. [2024-06-27 22:29:57,613 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 604 selfloop transitions, 177 changer transitions 0/794 dead transitions. [2024-06-27 22:29:57,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 794 transitions, 18220 flow [2024-06-27 22:29:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:29:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:29:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:29:57,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2024-06-27 22:29:57,615 INFO L175 Difference]: Start difference. First operand has 201 places, 717 transitions, 16001 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:29:57,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 794 transitions, 18220 flow [2024-06-27 22:29:58,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 794 transitions, 17749 flow, removed 109 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:58,401 INFO L231 Difference]: Finished difference. Result has 208 places, 745 transitions, 16413 flow [2024-06-27 22:29:58,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15530, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16413, PETRI_PLACES=208, PETRI_TRANSITIONS=745} [2024-06-27 22:29:58,402 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 156 predicate places. [2024-06-27 22:29:58,402 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 745 transitions, 16413 flow [2024-06-27 22:29:58,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:58,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:58,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:58,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:29:58,403 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:29:58,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2071414717, now seen corresponding path program 5 times [2024-06-27 22:29:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677044960] [2024-06-27 22:29:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:29:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677044960] [2024-06-27 22:29:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677044960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:59,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:29:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227179129] [2024-06-27 22:29:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:59,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:29:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:59,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:29:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:29:59,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:29:59,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 745 transitions, 16413 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:59,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:59,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:29:59,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:02,028 INFO L124 PetriNetUnfolderBase]: 6670/10377 cut-off events. [2024-06-27 22:30:02,028 INFO L125 PetriNetUnfolderBase]: For 354487/354503 co-relation queries the response was YES. [2024-06-27 22:30:02,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84429 conditions, 10377 events. 6670/10377 cut-off events. For 354487/354503 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 63586 event pairs, 1570 based on Foata normal form. 24/10180 useless extension candidates. Maximal degree in co-relation 84338. Up to 8679 conditions per place. [2024-06-27 22:30:02,140 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 504 selfloop transitions, 292 changer transitions 0/809 dead transitions. [2024-06-27 22:30:02,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 809 transitions, 18551 flow [2024-06-27 22:30:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:30:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:30:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:30:02,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2024-06-27 22:30:02,142 INFO L175 Difference]: Start difference. First operand has 208 places, 745 transitions, 16413 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:30:02,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 809 transitions, 18551 flow [2024-06-27 22:30:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 809 transitions, 18167 flow, removed 109 selfloop flow, removed 5 redundant places. [2024-06-27 22:30:02,979 INFO L231 Difference]: Finished difference. Result has 212 places, 759 transitions, 16961 flow [2024-06-27 22:30:02,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16029, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16961, PETRI_PLACES=212, PETRI_TRANSITIONS=759} [2024-06-27 22:30:02,980 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 160 predicate places. [2024-06-27 22:30:02,981 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 759 transitions, 16961 flow [2024-06-27 22:30:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:02,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:02,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:30:02,981 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:02,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2104327137, now seen corresponding path program 1 times [2024-06-27 22:30:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335655688] [2024-06-27 22:30:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:04,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335655688] [2024-06-27 22:30:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335655688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204074610] [2024-06-27 22:30:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:04,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:04,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:04,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 759 transitions, 16961 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:04,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:04,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:04,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:06,698 INFO L124 PetriNetUnfolderBase]: 7350/11126 cut-off events. [2024-06-27 22:30:06,699 INFO L125 PetriNetUnfolderBase]: For 363937/363955 co-relation queries the response was YES. [2024-06-27 22:30:06,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89511 conditions, 11126 events. 7350/11126 cut-off events. For 363937/363955 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 65241 event pairs, 1719 based on Foata normal form. 22/10925 useless extension candidates. Maximal degree in co-relation 89418. Up to 9507 conditions per place. [2024-06-27 22:30:06,831 INFO L140 encePairwiseOnDemand]: 28/46 looper letters, 418 selfloop transitions, 393 changer transitions 0/818 dead transitions. [2024-06-27 22:30:06,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 818 transitions, 19050 flow [2024-06-27 22:30:06,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:30:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:30:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-06-27 22:30:06,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49782608695652175 [2024-06-27 22:30:06,833 INFO L175 Difference]: Start difference. First operand has 212 places, 759 transitions, 16961 flow. Second operand 10 states and 229 transitions. [2024-06-27 22:30:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 818 transitions, 19050 flow [2024-06-27 22:30:07,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 818 transitions, 18371 flow, removed 98 selfloop flow, removed 6 redundant places. [2024-06-27 22:30:07,941 INFO L231 Difference]: Finished difference. Result has 216 places, 763 transitions, 17198 flow [2024-06-27 22:30:07,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16282, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17198, PETRI_PLACES=216, PETRI_TRANSITIONS=763} [2024-06-27 22:30:07,942 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 164 predicate places. [2024-06-27 22:30:07,942 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 763 transitions, 17198 flow [2024-06-27 22:30:07,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:07,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:07,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:30:07,943 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:07,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2104326858, now seen corresponding path program 1 times [2024-06-27 22:30:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629633413] [2024-06-27 22:30:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629633413] [2024-06-27 22:30:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629633413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:30:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994218692] [2024-06-27 22:30:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:09,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:30:09,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:30:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:30:09,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:09,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 763 transitions, 17198 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:09,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:09,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:09,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:11,949 INFO L124 PetriNetUnfolderBase]: 7538/11410 cut-off events. [2024-06-27 22:30:11,949 INFO L125 PetriNetUnfolderBase]: For 390727/390745 co-relation queries the response was YES. [2024-06-27 22:30:12,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91801 conditions, 11410 events. 7538/11410 cut-off events. For 390727/390745 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 67111 event pairs, 1695 based on Foata normal form. 42/11229 useless extension candidates. Maximal degree in co-relation 91707. Up to 9575 conditions per place. [2024-06-27 22:30:12,273 INFO L140 encePairwiseOnDemand]: 28/46 looper letters, 426 selfloop transitions, 392 changer transitions 0/825 dead transitions. [2024-06-27 22:30:12,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 825 transitions, 19299 flow [2024-06-27 22:30:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:30:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:30:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2024-06-27 22:30:12,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2024-06-27 22:30:12,278 INFO L175 Difference]: Start difference. First operand has 216 places, 763 transitions, 17198 flow. Second operand 10 states and 232 transitions. [2024-06-27 22:30:12,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 825 transitions, 19299 flow [2024-06-27 22:30:13,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 825 transitions, 18463 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-27 22:30:13,162 INFO L231 Difference]: Finished difference. Result has 218 places, 766 transitions, 17253 flow [2024-06-27 22:30:13,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16362, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17253, PETRI_PLACES=218, PETRI_TRANSITIONS=766} [2024-06-27 22:30:13,177 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 166 predicate places. [2024-06-27 22:30:13,177 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 766 transitions, 17253 flow [2024-06-27 22:30:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:13,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:13,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:13,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:30:13,178 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:13,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 644191378, now seen corresponding path program 1 times [2024-06-27 22:30:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554725024] [2024-06-27 22:30:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554725024] [2024-06-27 22:30:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554725024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:30:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920412071] [2024-06-27 22:30:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:30:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:30:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:30:13,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:13,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 766 transitions, 17253 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:13,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:13,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:16,549 INFO L124 PetriNetUnfolderBase]: 7577/11513 cut-off events. [2024-06-27 22:30:16,549 INFO L125 PetriNetUnfolderBase]: For 396678/396682 co-relation queries the response was YES. [2024-06-27 22:30:16,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92987 conditions, 11513 events. 7577/11513 cut-off events. For 396678/396682 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 68394 event pairs, 2405 based on Foata normal form. 5/11298 useless extension candidates. Maximal degree in co-relation 92892. Up to 10661 conditions per place. [2024-06-27 22:30:16,674 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 765 selfloop transitions, 47 changer transitions 0/819 dead transitions. [2024-06-27 22:30:16,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 819 transitions, 19473 flow [2024-06-27 22:30:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:30:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:30:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 22:30:16,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937888198757764 [2024-06-27 22:30:16,698 INFO L175 Difference]: Start difference. First operand has 218 places, 766 transitions, 17253 flow. Second operand 7 states and 159 transitions. [2024-06-27 22:30:16,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 819 transitions, 19473 flow [2024-06-27 22:30:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 819 transitions, 18927 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 22:30:17,570 INFO L231 Difference]: Finished difference. Result has 222 places, 782 transitions, 17031 flow [2024-06-27 22:30:17,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16707, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=17031, PETRI_PLACES=222, PETRI_TRANSITIONS=782} [2024-06-27 22:30:17,571 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 170 predicate places. [2024-06-27 22:30:17,571 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 782 transitions, 17031 flow [2024-06-27 22:30:17,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:17,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:17,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:17,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:30:17,572 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:17,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 465776209, now seen corresponding path program 6 times [2024-06-27 22:30:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000978660] [2024-06-27 22:30:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:18,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-27 22:30:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000978660] [2024-06-27 22:30:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000978660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534737646] [2024-06-27 22:30:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:18,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:18,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:30:18,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 782 transitions, 17031 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:18,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:18,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:30:18,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:21,257 INFO L124 PetriNetUnfolderBase]: 7274/11345 cut-off events. [2024-06-27 22:30:21,258 INFO L125 PetriNetUnfolderBase]: For 412710/412794 co-relation queries the response was YES. [2024-06-27 22:30:21,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93780 conditions, 11345 events. 7274/11345 cut-off events. For 412710/412794 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 71142 event pairs, 1395 based on Foata normal form. 29/11131 useless extension candidates. Maximal degree in co-relation 93681. Up to 9671 conditions per place. [2024-06-27 22:30:21,405 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 669 selfloop transitions, 199 changer transitions 0/881 dead transitions. [2024-06-27 22:30:21,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 881 transitions, 19810 flow [2024-06-27 22:30:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:30:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:30:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-27 22:30:21,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2024-06-27 22:30:21,407 INFO L175 Difference]: Start difference. First operand has 222 places, 782 transitions, 17031 flow. Second operand 9 states and 201 transitions. [2024-06-27 22:30:21,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 881 transitions, 19810 flow [2024-06-27 22:30:22,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 881 transitions, 19758 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-27 22:30:22,529 INFO L231 Difference]: Finished difference. Result has 231 places, 838 transitions, 18366 flow [2024-06-27 22:30:22,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16979, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18366, PETRI_PLACES=231, PETRI_TRANSITIONS=838} [2024-06-27 22:30:22,530 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 179 predicate places. [2024-06-27 22:30:22,530 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 838 transitions, 18366 flow [2024-06-27 22:30:22,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:22,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:22,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:30:22,531 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:22,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 424998981, now seen corresponding path program 7 times [2024-06-27 22:30:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996651551] [2024-06-27 22:30:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996651551] [2024-06-27 22:30:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996651551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912048070] [2024-06-27 22:30:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:23,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:23,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:30:23,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 838 transitions, 18366 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:23,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:23,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:30:23,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:26,558 INFO L124 PetriNetUnfolderBase]: 7494/11699 cut-off events. [2024-06-27 22:30:26,558 INFO L125 PetriNetUnfolderBase]: For 453382/453466 co-relation queries the response was YES. [2024-06-27 22:30:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98775 conditions, 11699 events. 7494/11699 cut-off events. For 453382/453466 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 73828 event pairs, 1454 based on Foata normal form. 33/11495 useless extension candidates. Maximal degree in co-relation 98672. Up to 9892 conditions per place. [2024-06-27 22:30:26,690 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 592 selfloop transitions, 301 changer transitions 0/906 dead transitions. [2024-06-27 22:30:26,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 906 transitions, 20805 flow [2024-06-27 22:30:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:30:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:30:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:30:26,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-27 22:30:26,692 INFO L175 Difference]: Start difference. First operand has 231 places, 838 transitions, 18366 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:30:26,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 906 transitions, 20805 flow [2024-06-27 22:30:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 906 transitions, 20238 flow, removed 119 selfloop flow, removed 6 redundant places. [2024-06-27 22:30:27,903 INFO L231 Difference]: Finished difference. Result has 233 places, 866 transitions, 18946 flow [2024-06-27 22:30:27,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17799, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18946, PETRI_PLACES=233, PETRI_TRANSITIONS=866} [2024-06-27 22:30:27,906 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 181 predicate places. [2024-06-27 22:30:27,906 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 866 transitions, 18946 flow [2024-06-27 22:30:27,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:27,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:27,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:27,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:30:27,907 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:27,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1616671855, now seen corresponding path program 2 times [2024-06-27 22:30:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197816666] [2024-06-27 22:30:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197816666] [2024-06-27 22:30:29,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197816666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133844326] [2024-06-27 22:30:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:29,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:29,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:29,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 866 transitions, 18946 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:29,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:29,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:29,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:32,795 INFO L124 PetriNetUnfolderBase]: 8493/12785 cut-off events. [2024-06-27 22:30:32,795 INFO L125 PetriNetUnfolderBase]: For 458723/458750 co-relation queries the response was YES. [2024-06-27 22:30:32,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105647 conditions, 12785 events. 8493/12785 cut-off events. For 458723/458750 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 76384 event pairs, 1674 based on Foata normal form. 20/12567 useless extension candidates. Maximal degree in co-relation 105544. Up to 11346 conditions per place. [2024-06-27 22:30:32,984 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 607 selfloop transitions, 321 changer transitions 0/935 dead transitions. [2024-06-27 22:30:32,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 935 transitions, 21706 flow [2024-06-27 22:30:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:30:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:30:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2024-06-27 22:30:32,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48043478260869565 [2024-06-27 22:30:32,985 INFO L175 Difference]: Start difference. First operand has 233 places, 866 transitions, 18946 flow. Second operand 10 states and 221 transitions. [2024-06-27 22:30:32,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 935 transitions, 21706 flow [2024-06-27 22:30:34,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 935 transitions, 20945 flow, removed 107 selfloop flow, removed 6 redundant places. [2024-06-27 22:30:34,665 INFO L231 Difference]: Finished difference. Result has 238 places, 882 transitions, 19287 flow [2024-06-27 22:30:34,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18185, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19287, PETRI_PLACES=238, PETRI_TRANSITIONS=882} [2024-06-27 22:30:34,672 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 186 predicate places. [2024-06-27 22:30:34,672 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 882 transitions, 19287 flow [2024-06-27 22:30:34,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:34,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:34,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:34,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:30:34,673 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:34,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 544224702, now seen corresponding path program 2 times [2024-06-27 22:30:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682571385] [2024-06-27 22:30:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682571385] [2024-06-27 22:30:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682571385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:36,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:30:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393640603] [2024-06-27 22:30:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:36,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:30:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:36,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:30:36,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:30:36,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:36,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 882 transitions, 19287 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:36,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:36,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:36,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:39,679 INFO L124 PetriNetUnfolderBase]: 8837/13297 cut-off events. [2024-06-27 22:30:39,680 INFO L125 PetriNetUnfolderBase]: For 505105/505132 co-relation queries the response was YES. [2024-06-27 22:30:39,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110433 conditions, 13297 events. 8837/13297 cut-off events. For 505105/505132 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 79937 event pairs, 1700 based on Foata normal form. 42/13101 useless extension candidates. Maximal degree in co-relation 110328. Up to 11518 conditions per place. [2024-06-27 22:30:39,846 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 627 selfloop transitions, 311 changer transitions 0/945 dead transitions. [2024-06-27 22:30:39,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 945 transitions, 21777 flow [2024-06-27 22:30:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:30:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:30:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-27 22:30:39,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2024-06-27 22:30:39,847 INFO L175 Difference]: Start difference. First operand has 238 places, 882 transitions, 19287 flow. Second operand 10 states and 223 transitions. [2024-06-27 22:30:39,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 945 transitions, 21777 flow [2024-06-27 22:30:41,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 945 transitions, 21283 flow, removed 84 selfloop flow, removed 6 redundant places. [2024-06-27 22:30:41,413 INFO L231 Difference]: Finished difference. Result has 242 places, 888 transitions, 19603 flow [2024-06-27 22:30:41,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18793, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19603, PETRI_PLACES=242, PETRI_TRANSITIONS=888} [2024-06-27 22:30:41,414 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 190 predicate places. [2024-06-27 22:30:41,415 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 888 transitions, 19603 flow [2024-06-27 22:30:41,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:41,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:41,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:41,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:30:41,415 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:41,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash 544009221, now seen corresponding path program 8 times [2024-06-27 22:30:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:41,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303904445] [2024-06-27 22:30:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303904445] [2024-06-27 22:30:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303904445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607240251] [2024-06-27 22:30:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:43,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:43,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 22:30:43,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 888 transitions, 19603 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:43,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:43,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 22:30:43,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:46,763 INFO L124 PetriNetUnfolderBase]: 8137/12652 cut-off events. [2024-06-27 22:30:46,763 INFO L125 PetriNetUnfolderBase]: For 561834/561918 co-relation queries the response was YES. [2024-06-27 22:30:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112263 conditions, 12652 events. 8137/12652 cut-off events. For 561834/561918 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 80398 event pairs, 1496 based on Foata normal form. 51/12445 useless extension candidates. Maximal degree in co-relation 112156. Up to 10218 conditions per place. [2024-06-27 22:30:46,911 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 614 selfloop transitions, 325 changer transitions 0/952 dead transitions. [2024-06-27 22:30:46,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 952 transitions, 22292 flow [2024-06-27 22:30:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:30:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:30:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:30:46,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 22:30:46,918 INFO L175 Difference]: Start difference. First operand has 242 places, 888 transitions, 19603 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:30:46,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 952 transitions, 22292 flow [2024-06-27 22:30:48,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 952 transitions, 21657 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-27 22:30:48,232 INFO L231 Difference]: Finished difference. Result has 244 places, 895 transitions, 19952 flow [2024-06-27 22:30:48,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18968, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19952, PETRI_PLACES=244, PETRI_TRANSITIONS=895} [2024-06-27 22:30:48,233 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 192 predicate places. [2024-06-27 22:30:48,233 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 895 transitions, 19952 flow [2024-06-27 22:30:48,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:48,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:48,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:48,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:30:48,234 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:48,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -937667222, now seen corresponding path program 2 times [2024-06-27 22:30:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177468135] [2024-06-27 22:30:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177468135] [2024-06-27 22:30:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177468135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:30:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107254885] [2024-06-27 22:30:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:30:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:49,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:30:49,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:30:49,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:49,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 895 transitions, 19952 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:49,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:49,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:49,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:52,892 INFO L124 PetriNetUnfolderBase]: 9171/13823 cut-off events. [2024-06-27 22:30:52,892 INFO L125 PetriNetUnfolderBase]: For 552889/552898 co-relation queries the response was YES. [2024-06-27 22:30:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118273 conditions, 13823 events. 9171/13823 cut-off events. For 552889/552898 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 84001 event pairs, 2675 based on Foata normal form. 7/13609 useless extension candidates. Maximal degree in co-relation 118164. Up to 12947 conditions per place. [2024-06-27 22:30:53,062 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 872 selfloop transitions, 56 changer transitions 0/935 dead transitions. [2024-06-27 22:30:53,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 935 transitions, 22345 flow [2024-06-27 22:30:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:30:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:30:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 22:30:53,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2024-06-27 22:30:53,064 INFO L175 Difference]: Start difference. First operand has 244 places, 895 transitions, 19952 flow. Second operand 6 states and 136 transitions. [2024-06-27 22:30:53,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 935 transitions, 22345 flow [2024-06-27 22:30:54,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 935 transitions, 21874 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 22:30:54,580 INFO L231 Difference]: Finished difference. Result has 246 places, 907 transitions, 19759 flow [2024-06-27 22:30:54,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19481, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19759, PETRI_PLACES=246, PETRI_TRANSITIONS=907} [2024-06-27 22:30:54,582 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 194 predicate places. [2024-06-27 22:30:54,582 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 907 transitions, 19759 flow [2024-06-27 22:30:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:54,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:30:54,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:30:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:30:54,583 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:30:54,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:30:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash 152842860, now seen corresponding path program 3 times [2024-06-27 22:30:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:30:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178996889] [2024-06-27 22:30:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:30:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:30:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:30:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:30:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:30:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178996889] [2024-06-27 22:30:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178996889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:30:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:30:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:30:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937637727] [2024-06-27 22:30:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:30:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:30:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:30:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:30:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:30:56,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:30:56,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 907 transitions, 19759 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:30:56,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:30:56,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:30:56,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:30:59,957 INFO L124 PetriNetUnfolderBase]: 9239/13899 cut-off events. [2024-06-27 22:30:59,957 INFO L125 PetriNetUnfolderBase]: For 562735/562771 co-relation queries the response was YES. [2024-06-27 22:31:00,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118532 conditions, 13899 events. 9239/13899 cut-off events. For 562735/562771 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 84155 event pairs, 1778 based on Foata normal form. 32/13683 useless extension candidates. Maximal degree in co-relation 118420. Up to 12136 conditions per place. [2024-06-27 22:31:00,129 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 495 selfloop transitions, 464 changer transitions 0/966 dead transitions. [2024-06-27 22:31:00,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 966 transitions, 22268 flow [2024-06-27 22:31:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:31:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:31:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-06-27 22:31:00,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048309178743962 [2024-06-27 22:31:00,130 INFO L175 Difference]: Start difference. First operand has 246 places, 907 transitions, 19759 flow. Second operand 9 states and 209 transitions. [2024-06-27 22:31:00,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 966 transitions, 22268 flow [2024-06-27 22:31:01,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 966 transitions, 22125 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 22:31:01,897 INFO L231 Difference]: Finished difference. Result has 253 places, 915 transitions, 20764 flow [2024-06-27 22:31:01,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19616, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20764, PETRI_PLACES=253, PETRI_TRANSITIONS=915} [2024-06-27 22:31:01,898 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 201 predicate places. [2024-06-27 22:31:01,898 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 915 transitions, 20764 flow [2024-06-27 22:31:01,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:01,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:01,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:01,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:31:01,899 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:31:01,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash 162366060, now seen corresponding path program 4 times [2024-06-27 22:31:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133205246] [2024-06-27 22:31:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133205246] [2024-06-27 22:31:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133205246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:31:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230458142] [2024-06-27 22:31:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:03,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:31:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:31:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:31:03,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:31:03,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 915 transitions, 20764 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:03,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:03,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:31:03,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:07,319 INFO L124 PetriNetUnfolderBase]: 9468/14247 cut-off events. [2024-06-27 22:31:07,319 INFO L125 PetriNetUnfolderBase]: For 630424/630460 co-relation queries the response was YES. [2024-06-27 22:31:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125658 conditions, 14247 events. 9468/14247 cut-off events. For 630424/630460 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 86654 event pairs, 1584 based on Foata normal form. 28/14026 useless extension candidates. Maximal degree in co-relation 125545. Up to 11135 conditions per place. [2024-06-27 22:31:07,523 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 463 selfloop transitions, 509 changer transitions 0/979 dead transitions. [2024-06-27 22:31:07,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 979 transitions, 23602 flow [2024-06-27 22:31:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:31:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:31:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 22:31:07,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 22:31:07,525 INFO L175 Difference]: Start difference. First operand has 253 places, 915 transitions, 20764 flow. Second operand 9 states and 216 transitions. [2024-06-27 22:31:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 979 transitions, 23602 flow [2024-06-27 22:31:09,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 979 transitions, 23021 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 22:31:09,597 INFO L231 Difference]: Finished difference. Result has 257 places, 921 transitions, 21459 flow [2024-06-27 22:31:09,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=20183, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=506, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21459, PETRI_PLACES=257, PETRI_TRANSITIONS=921} [2024-06-27 22:31:09,598 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 205 predicate places. [2024-06-27 22:31:09,599 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 921 transitions, 21459 flow [2024-06-27 22:31:09,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:09,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:09,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:31:09,599 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:31:09,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 162039630, now seen corresponding path program 5 times [2024-06-27 22:31:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783231291] [2024-06-27 22:31:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783231291] [2024-06-27 22:31:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783231291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:31:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956784612] [2024-06-27 22:31:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:31:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:31:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:31:11,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:31:11,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 921 transitions, 21459 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:11,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:11,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:31:11,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:15,135 INFO L124 PetriNetUnfolderBase]: 9502/14297 cut-off events. [2024-06-27 22:31:15,136 INFO L125 PetriNetUnfolderBase]: For 648074/648110 co-relation queries the response was YES. [2024-06-27 22:31:15,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128640 conditions, 14297 events. 9502/14297 cut-off events. For 648074/648110 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 86978 event pairs, 1814 based on Foata normal form. 28/14076 useless extension candidates. Maximal degree in co-relation 128525. Up to 12227 conditions per place. [2024-06-27 22:31:15,332 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 476 selfloop transitions, 492 changer transitions 0/975 dead transitions. [2024-06-27 22:31:15,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 975 transitions, 23963 flow [2024-06-27 22:31:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:31:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:31:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-06-27 22:31:15,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048309178743962 [2024-06-27 22:31:15,333 INFO L175 Difference]: Start difference. First operand has 257 places, 921 transitions, 21459 flow. Second operand 9 states and 209 transitions. [2024-06-27 22:31:15,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 975 transitions, 23963 flow [2024-06-27 22:31:17,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 975 transitions, 23282 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-27 22:31:17,184 INFO L231 Difference]: Finished difference. Result has 261 places, 924 transitions, 21904 flow [2024-06-27 22:31:17,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=20786, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21904, PETRI_PLACES=261, PETRI_TRANSITIONS=924} [2024-06-27 22:31:17,185 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 209 predicate places. [2024-06-27 22:31:17,185 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 924 transitions, 21904 flow [2024-06-27 22:31:17,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:17,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:17,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:17,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:31:17,185 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:31:17,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash -103657650, now seen corresponding path program 6 times [2024-06-27 22:31:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269404642] [2024-06-27 22:31:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269404642] [2024-06-27 22:31:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269404642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:18,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:31:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863262572] [2024-06-27 22:31:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:31:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:31:18,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:31:18,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 22:31:18,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 924 transitions, 21904 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:18,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:18,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 22:31:18,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:22,568 INFO L124 PetriNetUnfolderBase]: 9486/14273 cut-off events. [2024-06-27 22:31:22,569 INFO L125 PetriNetUnfolderBase]: For 650984/651020 co-relation queries the response was YES. [2024-06-27 22:31:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129181 conditions, 14273 events. 9486/14273 cut-off events. For 650984/651020 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 86821 event pairs, 1856 based on Foata normal form. 32/14056 useless extension candidates. Maximal degree in co-relation 129064. Up to 12509 conditions per place. [2024-06-27 22:31:22,956 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 505 selfloop transitions, 462 changer transitions 0/974 dead transitions. [2024-06-27 22:31:22,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 974 transitions, 24313 flow [2024-06-27 22:31:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:31:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:31:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-06-27 22:31:22,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048309178743962 [2024-06-27 22:31:22,958 INFO L175 Difference]: Start difference. First operand has 261 places, 924 transitions, 21904 flow. Second operand 9 states and 209 transitions. [2024-06-27 22:31:22,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 974 transitions, 24313 flow