./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:37:41,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:37:41,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:37:41,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:37:41,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:37:41,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:37:41,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:37:41,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:37:41,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:37:41,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:37:41,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:37:41,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:37:41,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:37:41,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:37:41,160 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:37:41,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:37:41,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:37:41,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:37:41,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:37:41,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:37:41,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:37:41,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:37:41,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:37:41,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:37:41,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:37:41,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:37:41,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:37:41,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:37:41,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:37:41,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:37:41,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:37:41,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:37:41,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:37:41,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:37:41,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:37:41,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:37:41,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:37:41,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:37:41,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:37:41,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:37:41,170 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:37:41,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:37:41,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:37:41,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:37:41,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:37:41,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:37:41,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:37:41,398 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:37:41,399 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:37:41,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.oepc.yml/witness.yml [2024-06-04 16:37:41,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:37:41,565 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:37:41,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-06-04 16:37:42,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:37:42,810 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:37:42,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-06-04 16:37:42,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4bf4fb4/57e9114bb4884a628ee6e2c4f3df3902/FLAG5b5d264b8 [2024-06-04 16:37:42,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4bf4fb4/57e9114bb4884a628ee6e2c4f3df3902 [2024-06-04 16:37:42,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:37:42,832 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:37:42,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:37:42,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:37:42,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:37:42,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:37:41" (1/2) ... [2024-06-04 16:37:42,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@878e48f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:37:42, skipping insertion in model container [2024-06-04 16:37:42,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:37:41" (1/2) ... [2024-06-04 16:37:42,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@334838d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:37:42, skipping insertion in model container [2024-06-04 16:37:42,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:37:42" (2/2) ... [2024-06-04 16:37:42,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@878e48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:42, skipping insertion in model container [2024-06-04 16:37:42,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:37:42" (2/2) ... [2024-06-04 16:37:42,840 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:37:42,889 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:37:42,890 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:37:42,891 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:37:42,891 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:37:42,892 INFO L106 edCorrectnessWitness]: ghost_update [L823-L823] multithreaded = 1; [2024-06-04 16:37:42,931 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:37:43,215 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:37:43,227 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:37:43,505 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:37:43,534 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:37:43,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43 WrapperNode [2024-06-04 16:37:43,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:37:43,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:37:43,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:37:43,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:37:43,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,650 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-06-04 16:37:43,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:37:43,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:37:43,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:37:43,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:37:43,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:37:43,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:37:43,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:37:43,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:37:43,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:37:43,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (1/1) ... [2024-06-04 16:37:43,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:37:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:37:43,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:37:43,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:37:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:37:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:37:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:37:43,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:37:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:37:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:37:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:37:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:37:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:37:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:37:43,820 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:37:43,910 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:37:43,911 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:37:44,743 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:37:44,743 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:37:44,933 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:37:44,933 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:37:44,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:37:44 BoogieIcfgContainer [2024-06-04 16:37:44,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:37:44,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:37:44,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:37:44,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:37:44,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:37:41" (1/4) ... [2024-06-04 16:37:44,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb7aab7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:37:44, skipping insertion in model container [2024-06-04 16:37:44,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:37:42" (2/4) ... [2024-06-04 16:37:44,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb7aab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:37:44, skipping insertion in model container [2024-06-04 16:37:44,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:37:43" (3/4) ... [2024-06-04 16:37:44,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb7aab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:37:44, skipping insertion in model container [2024-06-04 16:37:44,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:37:44" (4/4) ... [2024-06-04 16:37:44,947 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2024-06-04 16:37:44,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:37:44,961 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:37:44,961 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:37:45,043 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:37:45,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 16:37:45,110 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-04 16:37:45,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:37:45,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:37:45,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 16:37:45,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-04 16:37:45,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:37:45,132 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;@7427d9fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:37:45,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:37:45,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:37:45,138 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:37:45,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:37:45,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:45,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:37:45,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:45,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1828167494, now seen corresponding path program 1 times [2024-06-04 16:37:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990844862] [2024-06-04 16:37:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:45,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990844862] [2024-06-04 16:37:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990844862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:37:49,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430139180] [2024-06-04 16:37:49,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:37:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:37:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:37:49,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-04 16:37:49,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:49,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:49,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-04 16:37:49,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:50,201 INFO L124 PetriNetUnfolderBase]: 162/315 cut-off events. [2024-06-04 16:37:50,201 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 16:37:50,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 315 events. 162/315 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1246 event pairs, 97 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 614. Up to 288 conditions per place. [2024-06-04 16:37:50,205 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-04 16:37:50,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-04 16:37:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:37:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:37:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-06-04 16:37:50,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2024-06-04 16:37:50,215 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 58 transitions. [2024-06-04 16:37:50,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-04 16:37:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:37:50,218 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-04 16:37:50,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-04 16:37:50,222 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-04 16:37:50,222 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-04 16:37:50,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:50,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:50,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:50,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:37:50,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:50,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 228048693, now seen corresponding path program 1 times [2024-06-04 16:37:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899987251] [2024-06-04 16:37:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899987251] [2024-06-04 16:37:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899987251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:53,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:37:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124555802] [2024-06-04 16:37:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:53,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:37:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:37:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:37:53,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-04 16:37:53,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:53,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:53,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-04 16:37:53,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:54,101 INFO L124 PetriNetUnfolderBase]: 159/310 cut-off events. [2024-06-04 16:37:54,101 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-06-04 16:37:54,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 310 events. 159/310 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1214 event pairs, 79 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 685. Up to 274 conditions per place. [2024-06-04 16:37:54,105 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-04 16:37:54,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 165 flow [2024-06-04 16:37:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:37:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:37:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-04 16:37:54,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-06-04 16:37:54,107 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 74 transitions. [2024-06-04 16:37:54,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 165 flow [2024-06-04 16:37:54,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:37:54,109 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-04 16:37:54,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-04 16:37:54,110 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-04 16:37:54,110 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-04 16:37:54,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:54,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:54,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:54,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:37:54,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:54,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1541873971, now seen corresponding path program 1 times [2024-06-04 16:37:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071375583] [2024-06-04 16:37:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071375583] [2024-06-04 16:37:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071375583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:57,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:37:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260037361] [2024-06-04 16:37:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:37:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:37:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:37:57,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 16:37:57,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:57,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:57,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 16:37:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:57,739 INFO L124 PetriNetUnfolderBase]: 187/360 cut-off events. [2024-06-04 16:37:57,739 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2024-06-04 16:37:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 360 events. 187/360 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1392 event pairs, 83 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 878. Up to 313 conditions per place. [2024-06-04 16:37:57,742 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 16:37:57,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-04 16:37:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:37:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:37:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 16:37:57,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-06-04 16:37:57,744 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 86 transitions. [2024-06-04 16:37:57,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-04 16:37:57,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:37:57,746 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-04 16:37:57,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-04 16:37:57,747 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-04 16:37:57,747 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-04 16:37:57,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:57,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:57,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:57,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:37:57,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:57,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -553452156, now seen corresponding path program 1 times [2024-06-04 16:37:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193830196] [2024-06-04 16:37:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193830196] [2024-06-04 16:38:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193830196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:38:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181433303] [2024-06-04 16:38:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:38:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:38:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:38:01,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 16:38:01,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:01,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:01,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 16:38:01,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:01,262 INFO L124 PetriNetUnfolderBase]: 184/357 cut-off events. [2024-06-04 16:38:01,262 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2024-06-04 16:38:01,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 357 events. 184/357 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1364 event pairs, 65 based on Foata normal form. 2/358 useless extension candidates. Maximal degree in co-relation 948. Up to 299 conditions per place. [2024-06-04 16:38:01,264 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 36 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2024-06-04 16:38:01,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 263 flow [2024-06-04 16:38:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:38:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:38:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-04 16:38:01,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2024-06-04 16:38:01,266 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 6 states and 101 transitions. [2024-06-04 16:38:01,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 263 flow [2024-06-04 16:38:01,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 248 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:38:01,268 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 147 flow [2024-06-04 16:38:01,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-06-04 16:38:01,269 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-04 16:38:01,269 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 147 flow [2024-06-04 16:38:01,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:01,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:01,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:38:01,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:01,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash -190316767, now seen corresponding path program 1 times [2024-06-04 16:38:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:01,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130066641] [2024-06-04 16:38:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130066641] [2024-06-04 16:38:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130066641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:38:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851529659] [2024-06-04 16:38:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:38:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:38:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:38:08,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:38:08,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:08,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:08,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:38:08,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:09,321 INFO L124 PetriNetUnfolderBase]: 230/424 cut-off events. [2024-06-04 16:38:09,321 INFO L125 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2024-06-04 16:38:09,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 424 events. 230/424 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1588 event pairs, 100 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1230. Up to 402 conditions per place. [2024-06-04 16:38:09,323 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 30 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-06-04 16:38:09,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 237 flow [2024-06-04 16:38:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:38:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:38:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2024-06-04 16:38:09,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-04 16:38:09,326 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 147 flow. Second operand 5 states and 67 transitions. [2024-06-04 16:38:09,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 237 flow [2024-06-04 16:38:09,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 216 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:38:09,331 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 153 flow [2024-06-04 16:38:09,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-04 16:38:09,334 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-04 16:38:09,336 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 153 flow [2024-06-04 16:38:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:09,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:09,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:09,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:38:09,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:09,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash 708445859, now seen corresponding path program 1 times [2024-06-04 16:38:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882574175] [2024-06-04 16:38:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882574175] [2024-06-04 16:38:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882574175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:38:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93915317] [2024-06-04 16:38:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:13,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:38:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:13,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:38:13,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:38:13,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 16:38:13,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:13,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:13,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 16:38:13,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:13,891 INFO L124 PetriNetUnfolderBase]: 223/415 cut-off events. [2024-06-04 16:38:13,891 INFO L125 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2024-06-04 16:38:13,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 415 events. 223/415 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1547 event pairs, 58 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 1259. Up to 338 conditions per place. [2024-06-04 16:38:13,896 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 46 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-06-04 16:38:13,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 349 flow [2024-06-04 16:38:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:38:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:38:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-04 16:38:13,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-04 16:38:13,900 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 153 flow. Second operand 8 states and 124 transitions. [2024-06-04 16:38:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 349 flow [2024-06-04 16:38:13,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 338 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:38:13,902 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 202 flow [2024-06-04 16:38:13,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-04 16:38:13,905 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2024-06-04 16:38:13,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 202 flow [2024-06-04 16:38:13,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:13,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:13,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:13,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:38:13,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:13,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1623619635, now seen corresponding path program 1 times [2024-06-04 16:38:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144752017] [2024-06-04 16:38:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144752017] [2024-06-04 16:38:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144752017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:38:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707482978] [2024-06-04 16:38:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:38:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:38:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:38:22,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:38:22,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:22,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:22,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:38:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:23,424 INFO L124 PetriNetUnfolderBase]: 220/409 cut-off events. [2024-06-04 16:38:23,424 INFO L125 PetriNetUnfolderBase]: For 1121/1121 co-relation queries the response was YES. [2024-06-04 16:38:23,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 409 events. 220/409 cut-off events. For 1121/1121 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1490 event pairs, 58 based on Foata normal form. 3/411 useless extension candidates. Maximal degree in co-relation 1365. Up to 379 conditions per place. [2024-06-04 16:38:23,426 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2024-06-04 16:38:23,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 318 flow [2024-06-04 16:38:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:38:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:38:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 16:38:23,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2024-06-04 16:38:23,429 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 202 flow. Second operand 6 states and 79 transitions. [2024-06-04 16:38:23,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 318 flow [2024-06-04 16:38:23,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 289 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 16:38:23,432 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 206 flow [2024-06-04 16:38:23,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-04 16:38:23,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-04 16:38:23,433 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 206 flow [2024-06-04 16:38:23,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:23,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:23,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:38:23,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:23,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2069385460, now seen corresponding path program 1 times [2024-06-04 16:38:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346475821] [2024-06-04 16:38:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:30,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346475821] [2024-06-04 16:38:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346475821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:38:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115263766] [2024-06-04 16:38:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:30,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:38:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:38:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:38:30,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:38:30,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:30,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:30,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:38:30,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:30,831 INFO L124 PetriNetUnfolderBase]: 225/416 cut-off events. [2024-06-04 16:38:30,831 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2024-06-04 16:38:30,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 416 events. 225/416 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1546 event pairs, 58 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1443. Up to 377 conditions per place. [2024-06-04 16:38:30,834 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2024-06-04 16:38:30,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 362 flow [2024-06-04 16:38:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:38:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:38:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-04 16:38:30,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-04 16:38:30,837 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 206 flow. Second operand 6 states and 83 transitions. [2024-06-04 16:38:30,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 362 flow [2024-06-04 16:38:30,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:38:30,841 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 236 flow [2024-06-04 16:38:30,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-04 16:38:30,842 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-04 16:38:30,842 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 236 flow [2024-06-04 16:38:30,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:30,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:30,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:30,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:38:30,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:30,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1808870444, now seen corresponding path program 2 times [2024-06-04 16:38:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:30,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713109525] [2024-06-04 16:38:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713109525] [2024-06-04 16:38:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713109525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:38:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141001180] [2024-06-04 16:38:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:37,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:38:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:37,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:38:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:38:37,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:38:37,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:37,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:37,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:38:37,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:37,675 INFO L124 PetriNetUnfolderBase]: 223/413 cut-off events. [2024-06-04 16:38:37,676 INFO L125 PetriNetUnfolderBase]: For 1666/1666 co-relation queries the response was YES. [2024-06-04 16:38:37,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 413 events. 223/413 cut-off events. For 1666/1666 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1515 event pairs, 57 based on Foata normal form. 1/413 useless extension candidates. Maximal degree in co-relation 1505. Up to 387 conditions per place. [2024-06-04 16:38:37,678 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 39 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-04 16:38:37,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 344 flow [2024-06-04 16:38:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:38:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:38:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-04 16:38:37,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 16:38:37,679 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 236 flow. Second operand 6 states and 77 transitions. [2024-06-04 16:38:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 344 flow [2024-06-04 16:38:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 332 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:38:37,682 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 245 flow [2024-06-04 16:38:37,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-04 16:38:37,682 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-04 16:38:37,682 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 245 flow [2024-06-04 16:38:37,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:37,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:37,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:37,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:38:37,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:37,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 486985931, now seen corresponding path program 1 times [2024-06-04 16:38:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979160770] [2024-06-04 16:38:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979160770] [2024-06-04 16:38:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979160770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:38:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882235906] [2024-06-04 16:38:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:38:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:41,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:38:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:38:42,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 16:38:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 245 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:42,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:42,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 16:38:42,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:42,480 INFO L124 PetriNetUnfolderBase]: 217/403 cut-off events. [2024-06-04 16:38:42,481 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-06-04 16:38:42,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 403 events. 217/403 cut-off events. For 2095/2095 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1457 event pairs, 35 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1498. Up to 307 conditions per place. [2024-06-04 16:38:42,484 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 50 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2024-06-04 16:38:42,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 425 flow [2024-06-04 16:38:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-04 16:38:42,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478114478114478 [2024-06-04 16:38:42,486 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 245 flow. Second operand 9 states and 133 transitions. [2024-06-04 16:38:42,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 425 flow [2024-06-04 16:38:42,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 404 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 16:38:42,489 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 244 flow [2024-06-04 16:38:42,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-06-04 16:38:42,490 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-06-04 16:38:42,490 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 244 flow [2024-06-04 16:38:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:42,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:42,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:38:42,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:42,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1461964812, now seen corresponding path program 1 times [2024-06-04 16:38:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032665881] [2024-06-04 16:38:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032665881] [2024-06-04 16:38:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032665881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:49,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:38:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986689901] [2024-06-04 16:38:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:38:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:38:49,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:38:49,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:38:49,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:49,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:49,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:38:49,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:49,650 INFO L124 PetriNetUnfolderBase]: 238/426 cut-off events. [2024-06-04 16:38:49,650 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2024-06-04 16:38:49,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 426 events. 238/426 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1507 event pairs, 53 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1653. Up to 381 conditions per place. [2024-06-04 16:38:49,653 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 44 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-04 16:38:49,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 438 flow [2024-06-04 16:38:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:38:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:38:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 16:38:49,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-04 16:38:49,654 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 244 flow. Second operand 7 states and 90 transitions. [2024-06-04 16:38:49,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 438 flow [2024-06-04 16:38:49,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 402 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:38:49,657 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 269 flow [2024-06-04 16:38:49,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-06-04 16:38:49,658 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-06-04 16:38:49,658 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 269 flow [2024-06-04 16:38:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:49,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:49,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:49,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:38:49,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:49,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1461785074, now seen corresponding path program 1 times [2024-06-04 16:38:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109901945] [2024-06-04 16:38:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109901945] [2024-06-04 16:38:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109901945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:38:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066374252] [2024-06-04 16:38:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:56,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:38:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:38:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:38:57,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:38:57,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 269 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:57,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:57,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:38:57,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:57,375 INFO L124 PetriNetUnfolderBase]: 243/443 cut-off events. [2024-06-04 16:38:57,375 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2024-06-04 16:38:57,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 443 events. 243/443 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1622 event pairs, 56 based on Foata normal form. 3/445 useless extension candidates. Maximal degree in co-relation 1756. Up to 373 conditions per place. [2024-06-04 16:38:57,378 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 48 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2024-06-04 16:38:57,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 477 flow [2024-06-04 16:38:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:38:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:38:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-04 16:38:57,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 16:38:57,380 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 269 flow. Second operand 7 states and 98 transitions. [2024-06-04 16:38:57,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 477 flow [2024-06-04 16:38:57,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:38:57,386 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 322 flow [2024-06-04 16:38:57,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-06-04 16:38:57,387 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2024-06-04 16:38:57,387 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 322 flow [2024-06-04 16:38:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:57,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:57,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:57,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:38:57,388 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:57,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1461785322, now seen corresponding path program 2 times [2024-06-04 16:38:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345172758] [2024-06-04 16:38:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345172758] [2024-06-04 16:39:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345172758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:04,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802501680] [2024-06-04 16:39:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:04,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:04,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:04,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:04,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:04,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:04,416 INFO L124 PetriNetUnfolderBase]: 260/462 cut-off events. [2024-06-04 16:39:04,417 INFO L125 PetriNetUnfolderBase]: For 3665/3665 co-relation queries the response was YES. [2024-06-04 16:39:04,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 462 events. 260/462 cut-off events. For 3665/3665 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1649 event pairs, 55 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1991. Up to 416 conditions per place. [2024-06-04 16:39:04,420 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 48 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2024-06-04 16:39:04,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 514 flow [2024-06-04 16:39:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-04 16:39:04,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-04 16:39:04,421 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 322 flow. Second operand 7 states and 88 transitions. [2024-06-04 16:39:04,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 514 flow [2024-06-04 16:39:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 503 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:39:04,425 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 362 flow [2024-06-04 16:39:04,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-06-04 16:39:04,425 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2024-06-04 16:39:04,426 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 362 flow [2024-06-04 16:39:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:04,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:04,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:39:04,426 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:04,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 240418462, now seen corresponding path program 2 times [2024-06-04 16:39:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989284083] [2024-06-04 16:39:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989284083] [2024-06-04 16:39:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989284083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811442938] [2024-06-04 16:39:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:10,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:11,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:39:11,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 362 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:11,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:11,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:39:11,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:11,422 INFO L124 PetriNetUnfolderBase]: 255/463 cut-off events. [2024-06-04 16:39:11,422 INFO L125 PetriNetUnfolderBase]: For 4461/4461 co-relation queries the response was YES. [2024-06-04 16:39:11,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 463 events. 255/463 cut-off events. For 4461/4461 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1707 event pairs, 54 based on Foata normal form. 3/465 useless extension candidates. Maximal degree in co-relation 2049. Up to 422 conditions per place. [2024-06-04 16:39:11,426 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2024-06-04 16:39:11,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 518 flow [2024-06-04 16:39:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-04 16:39:11,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-04 16:39:11,427 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 362 flow. Second operand 7 states and 88 transitions. [2024-06-04 16:39:11,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 518 flow [2024-06-04 16:39:11,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 491 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:39:11,431 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 378 flow [2024-06-04 16:39:11,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=378, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-06-04 16:39:11,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-04 16:39:11,432 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 378 flow [2024-06-04 16:39:11,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:11,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:11,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:11,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:39:11,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:11,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -369114016, now seen corresponding path program 3 times [2024-06-04 16:39:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:11,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378647805] [2024-06-04 16:39:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378647805] [2024-06-04 16:39:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378647805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776009433] [2024-06-04 16:39:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:17,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:17,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:17,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:17,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:17,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:18,263 INFO L124 PetriNetUnfolderBase]: 267/474 cut-off events. [2024-06-04 16:39:18,264 INFO L125 PetriNetUnfolderBase]: For 4877/4877 co-relation queries the response was YES. [2024-06-04 16:39:18,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 474 events. 267/474 cut-off events. For 4877/4877 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1712 event pairs, 54 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2147. Up to 456 conditions per place. [2024-06-04 16:39:18,267 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-04 16:39:18,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 520 flow [2024-06-04 16:39:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 16:39:18,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463203463203463 [2024-06-04 16:39:18,268 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 378 flow. Second operand 7 states and 80 transitions. [2024-06-04 16:39:18,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 520 flow [2024-06-04 16:39:18,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 65 transitions, 493 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 16:39:18,272 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 376 flow [2024-06-04 16:39:18,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-06-04 16:39:18,273 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-04 16:39:18,273 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 376 flow [2024-06-04 16:39:18,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:18,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:18,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:18,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:39:18,274 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:18,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -369113768, now seen corresponding path program 3 times [2024-06-04 16:39:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544755738] [2024-06-04 16:39:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544755738] [2024-06-04 16:39:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544755738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273781066] [2024-06-04 16:39:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:24,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:24,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:24,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:39:24,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:24,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:24,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:39:24,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:25,268 INFO L124 PetriNetUnfolderBase]: 247/451 cut-off events. [2024-06-04 16:39:25,268 INFO L125 PetriNetUnfolderBase]: For 5311/5311 co-relation queries the response was YES. [2024-06-04 16:39:25,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 451 events. 247/451 cut-off events. For 5311/5311 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1663 event pairs, 52 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 2034. Up to 399 conditions per place. [2024-06-04 16:39:25,271 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 49 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-04 16:39:25,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 69 transitions, 528 flow [2024-06-04 16:39:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-04 16:39:25,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-04 16:39:25,272 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 376 flow. Second operand 7 states and 92 transitions. [2024-06-04 16:39:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 69 transitions, 528 flow [2024-06-04 16:39:25,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 490 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 16:39:25,277 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 369 flow [2024-06-04 16:39:25,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-06-04 16:39:25,277 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-04 16:39:25,277 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 369 flow [2024-06-04 16:39:25,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:25,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:25,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:39:25,278 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:25,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1923582313, now seen corresponding path program 1 times [2024-06-04 16:39:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750930373] [2024-06-04 16:39:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750930373] [2024-06-04 16:39:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750930373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:32,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:32,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994671688] [2024-06-04 16:39:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:32,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:32,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:32,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:32,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:32,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:33,019 INFO L124 PetriNetUnfolderBase]: 264/470 cut-off events. [2024-06-04 16:39:33,019 INFO L125 PetriNetUnfolderBase]: For 5790/5790 co-relation queries the response was YES. [2024-06-04 16:39:33,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 470 events. 264/470 cut-off events. For 5790/5790 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1730 event pairs, 52 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2163. Up to 405 conditions per place. [2024-06-04 16:39:33,022 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 55 selfloop transitions, 23 changer transitions 0/80 dead transitions. [2024-06-04 16:39:33,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 625 flow [2024-06-04 16:39:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:39:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:39:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 16:39:33,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-04 16:39:33,024 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 369 flow. Second operand 8 states and 103 transitions. [2024-06-04 16:39:33,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 625 flow [2024-06-04 16:39:33,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 584 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 16:39:33,030 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 407 flow [2024-06-04 16:39:33,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2024-06-04 16:39:33,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-04 16:39:33,031 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 407 flow [2024-06-04 16:39:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:33,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:33,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:33,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:39:33,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:33,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -533866750, now seen corresponding path program 1 times [2024-06-04 16:39:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909988531] [2024-06-04 16:39:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909988531] [2024-06-04 16:39:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909988531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347807671] [2024-06-04 16:39:39,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:39,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:39,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:39,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 407 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:39,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:39,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:39,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:40,264 INFO L124 PetriNetUnfolderBase]: 283/501 cut-off events. [2024-06-04 16:39:40,265 INFO L125 PetriNetUnfolderBase]: For 7041/7041 co-relation queries the response was YES. [2024-06-04 16:39:40,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 501 events. 283/501 cut-off events. For 7041/7041 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1864 event pairs, 57 based on Foata normal form. 3/503 useless extension candidates. Maximal degree in co-relation 2363. Up to 383 conditions per place. [2024-06-04 16:39:40,268 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 60 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2024-06-04 16:39:40,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 689 flow [2024-06-04 16:39:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:39:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:39:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 16:39:40,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 16:39:40,270 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 407 flow. Second operand 8 states and 108 transitions. [2024-06-04 16:39:40,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 689 flow [2024-06-04 16:39:40,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 652 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 16:39:40,276 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 453 flow [2024-06-04 16:39:40,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-06-04 16:39:40,276 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 48 predicate places. [2024-06-04 16:39:40,276 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 453 flow [2024-06-04 16:39:40,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:40,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:40,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:39:40,277 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:40,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1923732043, now seen corresponding path program 2 times [2024-06-04 16:39:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552054261] [2024-06-04 16:39:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552054261] [2024-06-04 16:39:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552054261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:47,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159322420] [2024-06-04 16:39:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:47,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:47,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:47,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:47,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:47,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:48,045 INFO L124 PetriNetUnfolderBase]: 286/506 cut-off events. [2024-06-04 16:39:48,045 INFO L125 PetriNetUnfolderBase]: For 7596/7596 co-relation queries the response was YES. [2024-06-04 16:39:48,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 506 events. 286/506 cut-off events. For 7596/7596 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1874 event pairs, 56 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 2499. Up to 440 conditions per place. [2024-06-04 16:39:48,049 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 58 selfloop transitions, 23 changer transitions 0/83 dead transitions. [2024-06-04 16:39:48,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 699 flow [2024-06-04 16:39:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:39:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:39:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:39:48,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-04 16:39:48,051 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 453 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:39:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 699 flow [2024-06-04 16:39:48,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 16:39:48,058 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 484 flow [2024-06-04 16:39:48,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-04 16:39:48,058 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2024-06-04 16:39:48,058 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 484 flow [2024-06-04 16:39:48,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:48,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:48,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:48,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:39:48,059 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:48,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -109539285, now seen corresponding path program 3 times [2024-06-04 16:39:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750062256] [2024-06-04 16:39:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750062256] [2024-06-04 16:39:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750062256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:54,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:54,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488444797] [2024-06-04 16:39:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:54,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:54,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:54,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:54,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:54,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:39:54,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 484 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:54,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:54,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:39:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:54,981 INFO L124 PetriNetUnfolderBase]: 289/511 cut-off events. [2024-06-04 16:39:54,981 INFO L125 PetriNetUnfolderBase]: For 8325/8325 co-relation queries the response was YES. [2024-06-04 16:39:54,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 511 events. 289/511 cut-off events. For 8325/8325 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1904 event pairs, 60 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 2591. Up to 444 conditions per place. [2024-06-04 16:39:54,997 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 56 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2024-06-04 16:39:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 726 flow [2024-06-04 16:39:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:39:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:39:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:39:54,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:39:54,998 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 484 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:39:54,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 726 flow [2024-06-04 16:39:55,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 687 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 16:39:55,005 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 514 flow [2024-06-04 16:39:55,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-06-04 16:39:55,006 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-04 16:39:55,006 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 514 flow [2024-06-04 16:39:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:55,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:55,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:55,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:39:55,007 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:55,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1929303890, now seen corresponding path program 2 times [2024-06-04 16:39:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:55,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377886594] [2024-06-04 16:39:55,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377886594] [2024-06-04 16:40:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377886594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:01,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:01,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268611694] [2024-06-04 16:40:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:01,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:01,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 514 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:01,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:01,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:01,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:02,289 INFO L124 PetriNetUnfolderBase]: 313/550 cut-off events. [2024-06-04 16:40:02,289 INFO L125 PetriNetUnfolderBase]: For 10281/10281 co-relation queries the response was YES. [2024-06-04 16:40:02,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 550 events. 313/550 cut-off events. For 10281/10281 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2093 event pairs, 63 based on Foata normal form. 3/552 useless extension candidates. Maximal degree in co-relation 2838. Up to 413 conditions per place. [2024-06-04 16:40:02,293 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 64 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2024-06-04 16:40:02,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 93 transitions, 852 flow [2024-06-04 16:40:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 16:40:02,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-04 16:40:02,296 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 514 flow. Second operand 8 states and 107 transitions. [2024-06-04 16:40:02,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 93 transitions, 852 flow [2024-06-04 16:40:02,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 813 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 16:40:02,303 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 562 flow [2024-06-04 16:40:02,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=562, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-06-04 16:40:02,303 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2024-06-04 16:40:02,303 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 562 flow [2024-06-04 16:40:02,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:02,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:02,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:02,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:40:02,305 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:02,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1929296450, now seen corresponding path program 3 times [2024-06-04 16:40:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223557834] [2024-06-04 16:40:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:09,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-04 16:40:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223557834] [2024-06-04 16:40:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223557834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778888517] [2024-06-04 16:40:09,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:09,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:09,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 562 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:09,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:09,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:09,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:09,764 INFO L124 PetriNetUnfolderBase]: 307/541 cut-off events. [2024-06-04 16:40:09,764 INFO L125 PetriNetUnfolderBase]: For 10743/10743 co-relation queries the response was YES. [2024-06-04 16:40:09,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 541 events. 307/541 cut-off events. For 10743/10743 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2060 event pairs, 61 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 2832. Up to 409 conditions per place. [2024-06-04 16:40:09,768 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 66 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2024-06-04 16:40:09,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 840 flow [2024-06-04 16:40:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 16:40:09,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-04 16:40:09,770 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 562 flow. Second operand 8 states and 109 transitions. [2024-06-04 16:40:09,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 840 flow [2024-06-04 16:40:09,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 797 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 16:40:09,778 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 576 flow [2024-06-04 16:40:09,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=576, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2024-06-04 16:40:09,779 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-04 16:40:09,779 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 576 flow [2024-06-04 16:40:09,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:09,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:09,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:09,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:40:09,779 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:09,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1137220812, now seen corresponding path program 4 times [2024-06-04 16:40:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329140560] [2024-06-04 16:40:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329140560] [2024-06-04 16:40:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329140560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975220284] [2024-06-04 16:40:16,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:16,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:16,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:16,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:16,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:16,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:16,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:16,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:17,116 INFO L124 PetriNetUnfolderBase]: 331/580 cut-off events. [2024-06-04 16:40:17,116 INFO L125 PetriNetUnfolderBase]: For 12685/12685 co-relation queries the response was YES. [2024-06-04 16:40:17,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 580 events. 331/580 cut-off events. For 12685/12685 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2251 event pairs, 65 based on Foata normal form. 3/582 useless extension candidates. Maximal degree in co-relation 3098. Up to 496 conditions per place. [2024-06-04 16:40:17,120 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 73 selfloop transitions, 19 changer transitions 0/94 dead transitions. [2024-06-04 16:40:17,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 928 flow [2024-06-04 16:40:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:40:17,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-04 16:40:17,122 INFO L175 Difference]: Start difference. First operand has 94 places, 74 transitions, 576 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:40:17,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 928 flow [2024-06-04 16:40:17,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 862 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 16:40:17,132 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 593 flow [2024-06-04 16:40:17,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=593, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2024-06-04 16:40:17,132 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2024-06-04 16:40:17,133 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 593 flow [2024-06-04 16:40:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:17,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:17,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:17,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:40:17,133 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:17,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1442368568, now seen corresponding path program 5 times [2024-06-04 16:40:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802632316] [2024-06-04 16:40:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802632316] [2024-06-04 16:40:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802632316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974596730] [2024-06-04 16:40:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:24,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:24,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 593 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:24,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:24,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:24,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:24,433 INFO L124 PetriNetUnfolderBase]: 325/571 cut-off events. [2024-06-04 16:40:24,433 INFO L125 PetriNetUnfolderBase]: For 12839/12839 co-relation queries the response was YES. [2024-06-04 16:40:24,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 571 events. 325/571 cut-off events. For 12839/12839 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2210 event pairs, 57 based on Foata normal form. 3/573 useless extension candidates. Maximal degree in co-relation 3008. Up to 492 conditions per place. [2024-06-04 16:40:24,437 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 71 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2024-06-04 16:40:24,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 859 flow [2024-06-04 16:40:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:40:24,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:40:24,440 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 593 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:40:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 859 flow [2024-06-04 16:40:24,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 811 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 16:40:24,450 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 590 flow [2024-06-04 16:40:24,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-04 16:40:24,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 66 predicate places. [2024-06-04 16:40:24,451 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 590 flow [2024-06-04 16:40:24,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:24,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:24,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:24,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:40:24,452 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:24,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 948045911, now seen corresponding path program 4 times [2024-06-04 16:40:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250403150] [2024-06-04 16:40:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250403150] [2024-06-04 16:40:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250403150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681821942] [2024-06-04 16:40:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:31,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:31,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:31,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 590 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:31,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:31,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:31,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:31,712 INFO L124 PetriNetUnfolderBase]: 323/568 cut-off events. [2024-06-04 16:40:31,712 INFO L125 PetriNetUnfolderBase]: For 12942/12942 co-relation queries the response was YES. [2024-06-04 16:40:31,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 568 events. 323/568 cut-off events. For 12942/12942 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2193 event pairs, 67 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 3008. Up to 547 conditions per place. [2024-06-04 16:40:31,721 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 72 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-04 16:40:31,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 86 transitions, 776 flow [2024-06-04 16:40:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:40:31,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2024-06-04 16:40:31,728 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 590 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:40:31,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 86 transitions, 776 flow [2024-06-04 16:40:31,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 86 transitions, 720 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:40:31,753 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 563 flow [2024-06-04 16:40:31,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=563, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2024-06-04 16:40:31,754 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-04 16:40:31,754 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 563 flow [2024-06-04 16:40:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:31,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:31,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:31,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:40:31,759 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:31,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1451572778, now seen corresponding path program 6 times [2024-06-04 16:40:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099511179] [2024-06-04 16:40:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:38,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-04 16:40:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099511179] [2024-06-04 16:40:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099511179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:38,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526469660] [2024-06-04 16:40:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:38,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:38,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:38,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:38,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:40:38,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 563 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:38,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:38,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:40:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:39,017 INFO L124 PetriNetUnfolderBase]: 317/559 cut-off events. [2024-06-04 16:40:39,017 INFO L125 PetriNetUnfolderBase]: For 13558/13558 co-relation queries the response was YES. [2024-06-04 16:40:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 559 events. 317/559 cut-off events. For 13558/13558 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2159 event pairs, 61 based on Foata normal form. 3/561 useless extension candidates. Maximal degree in co-relation 2892. Up to 522 conditions per place. [2024-06-04 16:40:39,021 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 76 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-04 16:40:39,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 90 transitions, 769 flow [2024-06-04 16:40:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 16:40:39,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 16:40:39,023 INFO L175 Difference]: Start difference. First operand has 99 places, 78 transitions, 563 flow. Second operand 8 states and 93 transitions. [2024-06-04 16:40:39,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 90 transitions, 769 flow [2024-06-04 16:40:39,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 705 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:40:39,033 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 528 flow [2024-06-04 16:40:39,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-04 16:40:39,034 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-04 16:40:39,034 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 528 flow [2024-06-04 16:40:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:39,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:39,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:39,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:40:39,035 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:39,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 948322617, now seen corresponding path program 1 times [2024-06-04 16:40:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888316816] [2024-06-04 16:40:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888316816] [2024-06-04 16:40:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888316816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:45,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794852174] [2024-06-04 16:40:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:45,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:45,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:40:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:40:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:46,249 INFO L124 PetriNetUnfolderBase]: 286/526 cut-off events. [2024-06-04 16:40:46,249 INFO L125 PetriNetUnfolderBase]: For 13565/13565 co-relation queries the response was YES. [2024-06-04 16:40:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 526 events. 286/526 cut-off events. For 13565/13565 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2095 event pairs, 57 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 2691. Up to 458 conditions per place. [2024-06-04 16:40:46,254 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-04 16:40:46,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 720 flow [2024-06-04 16:40:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 16:40:46,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-04 16:40:46,255 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 528 flow. Second operand 8 states and 98 transitions. [2024-06-04 16:40:46,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 90 transitions, 720 flow [2024-06-04 16:40:46,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 680 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 16:40:46,267 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 537 flow [2024-06-04 16:40:46,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=537, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2024-06-04 16:40:46,267 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-04 16:40:46,267 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 537 flow [2024-06-04 16:40:46,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:46,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:46,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:46,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:40:46,268 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:46,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1451911391, now seen corresponding path program 1 times [2024-06-04 16:40:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228855535] [2024-06-04 16:40:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228855535] [2024-06-04 16:40:54,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228855535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:54,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558522282] [2024-06-04 16:40:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:54,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:54,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:40:54,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 537 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:54,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:54,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:40:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:55,285 INFO L124 PetriNetUnfolderBase]: 282/520 cut-off events. [2024-06-04 16:40:55,286 INFO L125 PetriNetUnfolderBase]: For 13745/13745 co-relation queries the response was YES. [2024-06-04 16:40:55,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 520 events. 282/520 cut-off events. For 13745/13745 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2043 event pairs, 56 based on Foata normal form. 2/521 useless extension candidates. Maximal degree in co-relation 2666. Up to 455 conditions per place. [2024-06-04 16:40:55,289 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 66 selfloop transitions, 11 changer transitions 0/90 dead transitions. [2024-06-04 16:40:55,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 713 flow [2024-06-04 16:40:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-04 16:40:55,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:40:55,290 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 537 flow. Second operand 8 states and 96 transitions. [2024-06-04 16:40:55,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 90 transitions, 713 flow [2024-06-04 16:40:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 677 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:55,300 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 527 flow [2024-06-04 16:40:55,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=527, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-06-04 16:40:55,301 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-04 16:40:55,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 527 flow [2024-06-04 16:40:55,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:55,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:55,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:55,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:40:55,302 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:55,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 721998961, now seen corresponding path program 1 times [2024-06-04 16:40:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:55,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27292856] [2024-06-04 16:40:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27292856] [2024-06-04 16:41:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27292856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163428746] [2024-06-04 16:41:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:01,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:01,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:01,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:01,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 527 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:01,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:01,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:01,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:01,533 INFO L124 PetriNetUnfolderBase]: 313/553 cut-off events. [2024-06-04 16:41:01,534 INFO L125 PetriNetUnfolderBase]: For 14413/14413 co-relation queries the response was YES. [2024-06-04 16:41:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 553 events. 313/553 cut-off events. For 14413/14413 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2114 event pairs, 60 based on Foata normal form. 1/553 useless extension candidates. Maximal degree in co-relation 2846. Up to 505 conditions per place. [2024-06-04 16:41:01,536 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 87 selfloop transitions, 14 changer transitions 0/103 dead transitions. [2024-06-04 16:41:01,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 795 flow [2024-06-04 16:41:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:41:01,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-04 16:41:01,538 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 527 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:41:01,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 795 flow [2024-06-04 16:41:01,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 769 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 16:41:01,550 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 552 flow [2024-06-04 16:41:01,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2024-06-04 16:41:01,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2024-06-04 16:41:01,551 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 552 flow [2024-06-04 16:41:01,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:01,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:01,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:01,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:41:01,552 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:01,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 722118931, now seen corresponding path program 2 times [2024-06-04 16:41:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180794702] [2024-06-04 16:41:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180794702] [2024-06-04 16:41:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180794702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097820796] [2024-06-04 16:41:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:07,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:07,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:07,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 552 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:07,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:07,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:07,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:07,969 INFO L124 PetriNetUnfolderBase]: 316/558 cut-off events. [2024-06-04 16:41:07,969 INFO L125 PetriNetUnfolderBase]: For 15381/15381 co-relation queries the response was YES. [2024-06-04 16:41:07,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 558 events. 316/558 cut-off events. For 15381/15381 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2163 event pairs, 61 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 2943. Up to 469 conditions per place. [2024-06-04 16:41:07,972 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 72 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-04 16:41:07,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 898 flow [2024-06-04 16:41:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:41:07,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-04 16:41:07,975 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 552 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:41:07,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 105 transitions, 898 flow [2024-06-04 16:41:07,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 105 transitions, 863 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:41:07,985 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 624 flow [2024-06-04 16:41:07,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=624, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2024-06-04 16:41:07,986 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2024-06-04 16:41:07,986 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 624 flow [2024-06-04 16:41:07,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:07,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:07,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:07,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:41:07,987 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:07,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash 722119117, now seen corresponding path program 1 times [2024-06-04 16:41:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680644153] [2024-06-04 16:41:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680644153] [2024-06-04 16:41:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680644153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:41:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154821776] [2024-06-04 16:41:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:14,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:41:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:41:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:41:14,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:41:14,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 624 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:14,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:14,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:41:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:14,664 INFO L124 PetriNetUnfolderBase]: 335/589 cut-off events. [2024-06-04 16:41:14,665 INFO L125 PetriNetUnfolderBase]: For 18354/18354 co-relation queries the response was YES. [2024-06-04 16:41:14,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 589 events. 335/589 cut-off events. For 18354/18354 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2324 event pairs, 52 based on Foata normal form. 3/591 useless extension candidates. Maximal degree in co-relation 3187. Up to 364 conditions per place. [2024-06-04 16:41:14,668 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 74 selfloop transitions, 41 changer transitions 0/117 dead transitions. [2024-06-04 16:41:14,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 117 transitions, 1012 flow [2024-06-04 16:41:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:41:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:41:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 16:41:14,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-04 16:41:14,669 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 624 flow. Second operand 8 states and 126 transitions. [2024-06-04 16:41:14,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 117 transitions, 1012 flow [2024-06-04 16:41:14,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 117 transitions, 965 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:41:14,684 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 696 flow [2024-06-04 16:41:14,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=696, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2024-06-04 16:41:14,685 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-04 16:41:14,685 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 696 flow [2024-06-04 16:41:14,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:14,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:14,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:41:14,685 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:14,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 726767257, now seen corresponding path program 2 times [2024-06-04 16:41:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002469382] [2024-06-04 16:41:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:21,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:21,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002469382] [2024-06-04 16:41:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002469382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277759235] [2024-06-04 16:41:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:21,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:21,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:21,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:21,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 696 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:21,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:21,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:21,991 INFO L124 PetriNetUnfolderBase]: 359/628 cut-off events. [2024-06-04 16:41:21,991 INFO L125 PetriNetUnfolderBase]: For 21221/21221 co-relation queries the response was YES. [2024-06-04 16:41:21,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 628 events. 359/628 cut-off events. For 21221/21221 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2532 event pairs, 56 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 3593. Up to 384 conditions per place. [2024-06-04 16:41:21,995 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 40 changer transitions 0/119 dead transitions. [2024-06-04 16:41:21,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 1154 flow [2024-06-04 16:41:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 16:41:21,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 16:41:21,996 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 696 flow. Second operand 9 states and 123 transitions. [2024-06-04 16:41:21,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 1154 flow [2024-06-04 16:41:22,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 1090 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 16:41:22,014 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 753 flow [2024-06-04 16:41:22,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-06-04 16:41:22,015 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2024-06-04 16:41:22,015 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 753 flow [2024-06-04 16:41:22,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:22,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:22,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:22,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:41:22,015 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:22,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 726760747, now seen corresponding path program 3 times [2024-06-04 16:41:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748759304] [2024-06-04 16:41:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748759304] [2024-06-04 16:41:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748759304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:28,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:41:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305631341] [2024-06-04 16:41:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:41:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:41:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:41:28,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:41:28,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 753 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:28,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:28,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:41:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:28,737 INFO L124 PetriNetUnfolderBase]: 353/619 cut-off events. [2024-06-04 16:41:28,738 INFO L125 PetriNetUnfolderBase]: For 21109/21109 co-relation queries the response was YES. [2024-06-04 16:41:28,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3626 conditions, 619 events. 353/619 cut-off events. For 21109/21109 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2490 event pairs, 54 based on Foata normal form. 3/621 useless extension candidates. Maximal degree in co-relation 3570. Up to 380 conditions per place. [2024-06-04 16:41:28,741 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 80 selfloop transitions, 38 changer transitions 0/120 dead transitions. [2024-06-04 16:41:28,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 1121 flow [2024-06-04 16:41:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:41:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:41:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 16:41:28,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2024-06-04 16:41:28,743 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 753 flow. Second operand 8 states and 127 transitions. [2024-06-04 16:41:28,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 1121 flow [2024-06-04 16:41:28,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 1059 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 16:41:28,765 INFO L231 Difference]: Finished difference. Result has 115 places, 94 transitions, 772 flow [2024-06-04 16:41:28,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=115, PETRI_TRANSITIONS=94} [2024-06-04 16:41:28,765 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-04 16:41:28,765 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 94 transitions, 772 flow [2024-06-04 16:41:28,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:28,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:28,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:28,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:41:28,766 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:28,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 726760561, now seen corresponding path program 3 times [2024-06-04 16:41:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824067188] [2024-06-04 16:41:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:34,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824067188] [2024-06-04 16:41:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824067188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:34,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:34,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840730683] [2024-06-04 16:41:34,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:34,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:34,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:34,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 94 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:34,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:34,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:34,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:35,066 INFO L124 PetriNetUnfolderBase]: 356/624 cut-off events. [2024-06-04 16:41:35,066 INFO L125 PetriNetUnfolderBase]: For 21369/21369 co-relation queries the response was YES. [2024-06-04 16:41:35,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 624 events. 356/624 cut-off events. For 21369/21369 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2497 event pairs, 69 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3656. Up to 534 conditions per place. [2024-06-04 16:41:35,070 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2024-06-04 16:41:35,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 112 transitions, 1114 flow [2024-06-04 16:41:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:41:35,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-04 16:41:35,071 INFO L175 Difference]: Start difference. First operand has 115 places, 94 transitions, 772 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:41:35,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 112 transitions, 1114 flow [2024-06-04 16:41:35,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 1032 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 16:41:35,096 INFO L231 Difference]: Finished difference. Result has 117 places, 96 transitions, 775 flow [2024-06-04 16:41:35,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=775, PETRI_PLACES=117, PETRI_TRANSITIONS=96} [2024-06-04 16:41:35,096 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 85 predicate places. [2024-06-04 16:41:35,096 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 96 transitions, 775 flow [2024-06-04 16:41:35,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:35,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:35,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:35,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:41:35,097 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:35,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash 899250637, now seen corresponding path program 4 times [2024-06-04 16:41:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721023653] [2024-06-04 16:41:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721023653] [2024-06-04 16:41:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721023653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:41:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253687358] [2024-06-04 16:41:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:41:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:41:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:41:41,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:41:41,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 96 transitions, 775 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:41,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:41:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:41,830 INFO L124 PetriNetUnfolderBase]: 380/663 cut-off events. [2024-06-04 16:41:41,831 INFO L125 PetriNetUnfolderBase]: For 25365/25365 co-relation queries the response was YES. [2024-06-04 16:41:41,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 663 events. 380/663 cut-off events. For 25365/25365 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2711 event pairs, 70 based on Foata normal form. 3/665 useless extension candidates. Maximal degree in co-relation 3873. Up to 405 conditions per place. [2024-06-04 16:41:41,835 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 82 selfloop transitions, 40 changer transitions 0/124 dead transitions. [2024-06-04 16:41:41,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 1249 flow [2024-06-04 16:41:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:41:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:41:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 16:41:41,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-04 16:41:41,841 INFO L175 Difference]: Start difference. First operand has 117 places, 96 transitions, 775 flow. Second operand 8 states and 126 transitions. [2024-06-04 16:41:41,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 1249 flow [2024-06-04 16:41:41,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 1193 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:41:41,862 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 836 flow [2024-06-04 16:41:41,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=836, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-04 16:41:41,863 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 87 predicate places. [2024-06-04 16:41:41,863 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 836 flow [2024-06-04 16:41:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:41,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:41,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:41:41,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -321120595, now seen corresponding path program 5 times [2024-06-04 16:41:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781504113] [2024-06-04 16:41:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781504113] [2024-06-04 16:41:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781504113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343368372] [2024-06-04 16:41:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:49,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:49,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:49,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 836 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:49,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:49,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:49,612 INFO L124 PetriNetUnfolderBase]: 389/678 cut-off events. [2024-06-04 16:41:49,613 INFO L125 PetriNetUnfolderBase]: For 27015/27015 co-relation queries the response was YES. [2024-06-04 16:41:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 678 events. 389/678 cut-off events. For 27015/27015 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2788 event pairs, 76 based on Foata normal form. 3/680 useless extension candidates. Maximal degree in co-relation 4039. Up to 413 conditions per place. [2024-06-04 16:41:49,617 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 45 changer transitions 0/124 dead transitions. [2024-06-04 16:41:49,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 124 transitions, 1296 flow [2024-06-04 16:41:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-04 16:41:49,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-04 16:41:49,619 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 836 flow. Second operand 9 states and 121 transitions. [2024-06-04 16:41:49,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 124 transitions, 1296 flow [2024-06-04 16:41:49,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 1233 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:41:49,643 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 888 flow [2024-06-04 16:41:49,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2024-06-04 16:41:49,643 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-04 16:41:49,644 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 888 flow [2024-06-04 16:41:49,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:49,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:49,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:49,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:41:49,644 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:49,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -321351235, now seen corresponding path program 6 times [2024-06-04 16:41:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021090646] [2024-06-04 16:41:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021090646] [2024-06-04 16:41:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021090646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953833695] [2024-06-04 16:41:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:56,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:41:56,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 888 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:56,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:56,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:41:56,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:57,149 INFO L124 PetriNetUnfolderBase]: 383/669 cut-off events. [2024-06-04 16:41:57,149 INFO L125 PetriNetUnfolderBase]: For 26651/26651 co-relation queries the response was YES. [2024-06-04 16:41:57,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 669 events. 383/669 cut-off events. For 26651/26651 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2744 event pairs, 70 based on Foata normal form. 3/671 useless extension candidates. Maximal degree in co-relation 3962. Up to 409 conditions per place. [2024-06-04 16:41:57,182 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 42 changer transitions 0/125 dead transitions. [2024-06-04 16:41:57,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 1266 flow [2024-06-04 16:41:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 16:41:57,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175084175084175 [2024-06-04 16:41:57,184 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 888 flow. Second operand 9 states and 124 transitions. [2024-06-04 16:41:57,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 1266 flow [2024-06-04 16:41:57,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 1187 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:41:57,219 INFO L231 Difference]: Finished difference. Result has 127 places, 102 transitions, 898 flow [2024-06-04 16:41:57,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=898, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2024-06-04 16:41:57,220 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-04 16:41:57,220 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 898 flow [2024-06-04 16:41:57,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:57,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:57,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:57,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:41:57,221 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:57,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash -321357931, now seen corresponding path program 4 times [2024-06-04 16:41:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:57,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170240615] [2024-06-04 16:41:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170240615] [2024-06-04 16:42:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170240615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660164366] [2024-06-04 16:42:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:04,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:04,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:04,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:04,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 898 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:04,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:04,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:04,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:04,871 INFO L124 PetriNetUnfolderBase]: 386/674 cut-off events. [2024-06-04 16:42:04,872 INFO L125 PetriNetUnfolderBase]: For 26865/26865 co-relation queries the response was YES. [2024-06-04 16:42:04,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 674 events. 386/674 cut-off events. For 26865/26865 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2766 event pairs, 81 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4023. Up to 583 conditions per place. [2024-06-04 16:42:04,876 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 83 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2024-06-04 16:42:04,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 117 transitions, 1252 flow [2024-06-04 16:42:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:42:04,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-04 16:42:04,878 INFO L175 Difference]: Start difference. First operand has 127 places, 102 transitions, 898 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:42:04,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 117 transitions, 1252 flow [2024-06-04 16:42:04,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 117 transitions, 1142 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 16:42:04,904 INFO L231 Difference]: Finished difference. Result has 127 places, 104 transitions, 877 flow [2024-06-04 16:42:04,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2024-06-04 16:42:04,904 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-04 16:42:04,904 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 877 flow [2024-06-04 16:42:04,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:04,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:04,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:04,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:42:04,905 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:04,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash -894105845, now seen corresponding path program 7 times [2024-06-04 16:42:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176769867] [2024-06-04 16:42:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176769867] [2024-06-04 16:42:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176769867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911642197] [2024-06-04 16:42:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:11,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:12,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:12,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:12,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:12,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:12,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:12,440 INFO L124 PetriNetUnfolderBase]: 410/713 cut-off events. [2024-06-04 16:42:12,440 INFO L125 PetriNetUnfolderBase]: For 31776/31776 co-relation queries the response was YES. [2024-06-04 16:42:12,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 713 events. 410/713 cut-off events. For 31776/31776 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2983 event pairs, 78 based on Foata normal form. 3/715 useless extension candidates. Maximal degree in co-relation 4228. Up to 585 conditions per place. [2024-06-04 16:42:12,445 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 101 selfloop transitions, 24 changer transitions 0/127 dead transitions. [2024-06-04 16:42:12,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 1363 flow [2024-06-04 16:42:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:42:12,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-04 16:42:12,446 INFO L175 Difference]: Start difference. First operand has 127 places, 104 transitions, 877 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:42:12,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 127 transitions, 1363 flow [2024-06-04 16:42:12,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 1304 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:42:12,480 INFO L231 Difference]: Finished difference. Result has 130 places, 108 transitions, 907 flow [2024-06-04 16:42:12,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2024-06-04 16:42:12,483 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-04 16:42:12,483 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 907 flow [2024-06-04 16:42:12,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:12,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:12,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:12,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:42:12,484 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:12,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash -675346841, now seen corresponding path program 5 times [2024-06-04 16:42:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:12,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216142238] [2024-06-04 16:42:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216142238] [2024-06-04 16:42:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216142238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433049643] [2024-06-04 16:42:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:18,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:18,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:18,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 108 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:18,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:18,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:18,719 INFO L124 PetriNetUnfolderBase]: 408/710 cut-off events. [2024-06-04 16:42:18,719 INFO L125 PetriNetUnfolderBase]: For 31285/31285 co-relation queries the response was YES. [2024-06-04 16:42:18,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 710 events. 408/710 cut-off events. For 31285/31285 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2962 event pairs, 86 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 4230. Up to 686 conditions per place. [2024-06-04 16:42:18,723 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2024-06-04 16:42:18,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 117 transitions, 1157 flow [2024-06-04 16:42:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:42:18,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-04 16:42:18,725 INFO L175 Difference]: Start difference. First operand has 130 places, 108 transitions, 907 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:42:18,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 117 transitions, 1157 flow [2024-06-04 16:42:18,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 1097 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:42:18,763 INFO L231 Difference]: Finished difference. Result has 133 places, 108 transitions, 880 flow [2024-06-04 16:42:18,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=880, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2024-06-04 16:42:18,763 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-04 16:42:18,764 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 880 flow [2024-06-04 16:42:18,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:18,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:18,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:18,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:42:18,764 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:18,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1763747097, now seen corresponding path program 8 times [2024-06-04 16:42:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150294497] [2024-06-04 16:42:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150294497] [2024-06-04 16:42:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150294497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953837869] [2024-06-04 16:42:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:25,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:25,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:25,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 108 transitions, 880 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:25,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:25,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:25,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:26,253 INFO L124 PetriNetUnfolderBase]: 417/725 cut-off events. [2024-06-04 16:42:26,253 INFO L125 PetriNetUnfolderBase]: For 34206/34206 co-relation queries the response was YES. [2024-06-04 16:42:26,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 725 events. 417/725 cut-off events. For 34206/34206 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3055 event pairs, 66 based on Foata normal form. 3/727 useless extension candidates. Maximal degree in co-relation 4251. Up to 590 conditions per place. [2024-06-04 16:42:26,258 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 97 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2024-06-04 16:42:26,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 128 transitions, 1274 flow [2024-06-04 16:42:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:42:26,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-04 16:42:26,259 INFO L175 Difference]: Start difference. First operand has 133 places, 108 transitions, 880 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:42:26,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 128 transitions, 1274 flow [2024-06-04 16:42:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1202 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 16:42:26,303 INFO L231 Difference]: Finished difference. Result has 132 places, 110 transitions, 887 flow [2024-06-04 16:42:26,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=887, PETRI_PLACES=132, PETRI_TRANSITIONS=110} [2024-06-04 16:42:26,304 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-04 16:42:26,304 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 110 transitions, 887 flow [2024-06-04 16:42:26,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:26,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:26,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:26,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:42:26,305 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:26,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1763753607, now seen corresponding path program 9 times [2024-06-04 16:42:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641032349] [2024-06-04 16:42:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641032349] [2024-06-04 16:42:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641032349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689615922] [2024-06-04 16:42:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:33,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:33,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:33,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 110 transitions, 887 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:33,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:33,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:33,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:33,890 INFO L124 PetriNetUnfolderBase]: 411/716 cut-off events. [2024-06-04 16:42:33,890 INFO L125 PetriNetUnfolderBase]: For 33318/33318 co-relation queries the response was YES. [2024-06-04 16:42:33,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4256 conditions, 716 events. 411/716 cut-off events. For 33318/33318 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3022 event pairs, 66 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 4191. Up to 586 conditions per place. [2024-06-04 16:42:33,895 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 99 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-06-04 16:42:33,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 1267 flow [2024-06-04 16:42:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:42:33,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-04 16:42:33,896 INFO L175 Difference]: Start difference. First operand has 132 places, 110 transitions, 887 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:42:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 1267 flow [2024-06-04 16:42:33,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 1153 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:33,943 INFO L231 Difference]: Finished difference. Result has 133 places, 110 transitions, 832 flow [2024-06-04 16:42:33,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=832, PETRI_PLACES=133, PETRI_TRANSITIONS=110} [2024-06-04 16:42:33,947 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-04 16:42:33,947 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 110 transitions, 832 flow [2024-06-04 16:42:33,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:33,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:33,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:33,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:42:33,952 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:33,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -704766453, now seen corresponding path program 10 times [2024-06-04 16:42:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144991737] [2024-06-04 16:42:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144991737] [2024-06-04 16:42:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144991737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313231753] [2024-06-04 16:42:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:40,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:40,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:41,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:41,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 110 transitions, 832 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:41,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:41,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:41,381 INFO L124 PetriNetUnfolderBase]: 405/707 cut-off events. [2024-06-04 16:42:41,382 INFO L125 PetriNetUnfolderBase]: For 32172/32172 co-relation queries the response was YES. [2024-06-04 16:42:41,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 707 events. 405/707 cut-off events. For 32172/32172 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2952 event pairs, 78 based on Foata normal form. 3/709 useless extension candidates. Maximal degree in co-relation 4005. Up to 657 conditions per place. [2024-06-04 16:42:41,386 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 14 changer transitions 0/125 dead transitions. [2024-06-04 16:42:41,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 125 transitions, 1116 flow [2024-06-04 16:42:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:42:41,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 16:42:41,387 INFO L175 Difference]: Start difference. First operand has 133 places, 110 transitions, 832 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:42:41,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 125 transitions, 1116 flow [2024-06-04 16:42:41,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1063 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 16:42:41,433 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 812 flow [2024-06-04 16:42:41,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2024-06-04 16:42:41,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 103 predicate places. [2024-06-04 16:42:41,434 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 812 flow [2024-06-04 16:42:41,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:41,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:41,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:41,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:42:41,434 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:41,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1448339567, now seen corresponding path program 1 times [2024-06-04 16:42:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50597366] [2024-06-04 16:42:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:48,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50597366] [2024-06-04 16:42:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50597366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965568817] [2024-06-04 16:42:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:48,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:48,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:48,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:48,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:48,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 812 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:48,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:48,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:48,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:48,989 INFO L124 PetriNetUnfolderBase]: 401/701 cut-off events. [2024-06-04 16:42:48,989 INFO L125 PetriNetUnfolderBase]: For 30907/30907 co-relation queries the response was YES. [2024-06-04 16:42:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3972 conditions, 701 events. 401/701 cut-off events. For 30907/30907 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2929 event pairs, 76 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 3905. Up to 664 conditions per place. [2024-06-04 16:42:48,993 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2024-06-04 16:42:48,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 125 transitions, 1113 flow [2024-06-04 16:42:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 16:42:48,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-06-04 16:42:48,995 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 812 flow. Second operand 10 states and 108 transitions. [2024-06-04 16:42:48,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 125 transitions, 1113 flow [2024-06-04 16:42:49,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1050 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 16:42:49,041 INFO L231 Difference]: Finished difference. Result has 136 places, 114 transitions, 826 flow [2024-06-04 16:42:49,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=826, PETRI_PLACES=136, PETRI_TRANSITIONS=114} [2024-06-04 16:42:49,042 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-04 16:42:49,042 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 114 transitions, 826 flow [2024-06-04 16:42:49,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:49,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:49,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:49,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:42:49,043 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:49,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1722887944, now seen corresponding path program 1 times [2024-06-04 16:42:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543347690] [2024-06-04 16:42:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543347690] [2024-06-04 16:42:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543347690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917200163] [2024-06-04 16:42:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:57,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:57,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:42:57,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 114 transitions, 826 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:57,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:57,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:42:57,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:58,302 INFO L124 PetriNetUnfolderBase]: 409/714 cut-off events. [2024-06-04 16:42:58,303 INFO L125 PetriNetUnfolderBase]: For 32116/32116 co-relation queries the response was YES. [2024-06-04 16:42:58,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 714 events. 409/714 cut-off events. For 32116/32116 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3015 event pairs, 82 based on Foata normal form. 1/714 useless extension candidates. Maximal degree in co-relation 4035. Up to 650 conditions per place. [2024-06-04 16:42:58,307 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 121 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-04 16:42:58,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 1308 flow [2024-06-04 16:42:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:42:58,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36639118457300274 [2024-06-04 16:42:58,311 INFO L175 Difference]: Start difference. First operand has 136 places, 114 transitions, 826 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:42:58,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 1308 flow [2024-06-04 16:42:58,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 144 transitions, 1265 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:42:58,363 INFO L231 Difference]: Finished difference. Result has 140 places, 118 transitions, 870 flow [2024-06-04 16:42:58,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=870, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2024-06-04 16:42:58,366 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-04 16:42:58,366 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 870 flow [2024-06-04 16:42:58,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:58,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:58,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:58,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:42:58,367 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:58,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 907132332, now seen corresponding path program 2 times [2024-06-04 16:42:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828485920] [2024-06-04 16:42:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828485920] [2024-06-04 16:43:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828485920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:06,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729007799] [2024-06-04 16:43:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:06,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:06,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 870 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:06,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:06,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:06,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:07,039 INFO L124 PetriNetUnfolderBase]: 407/711 cut-off events. [2024-06-04 16:43:07,039 INFO L125 PetriNetUnfolderBase]: For 32654/32654 co-relation queries the response was YES. [2024-06-04 16:43:07,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 711 events. 407/711 cut-off events. For 32654/32654 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2999 event pairs, 82 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 4043. Up to 660 conditions per place. [2024-06-04 16:43:07,044 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2024-06-04 16:43:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 139 transitions, 1204 flow [2024-06-04 16:43:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:43:07,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-04 16:43:07,046 INFO L175 Difference]: Start difference. First operand has 140 places, 118 transitions, 870 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:43:07,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 139 transitions, 1204 flow [2024-06-04 16:43:07,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 1156 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 16:43:07,096 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 861 flow [2024-06-04 16:43:07,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2024-06-04 16:43:07,097 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-04 16:43:07,097 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 861 flow [2024-06-04 16:43:07,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:07,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:07,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:07,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:43:07,097 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:07,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1722978309, now seen corresponding path program 1 times [2024-06-04 16:43:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277323533] [2024-06-04 16:43:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277323533] [2024-06-04 16:43:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277323533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615004012] [2024-06-04 16:43:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:14,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:14,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 861 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:15,440 INFO L124 PetriNetUnfolderBase]: 416/726 cut-off events. [2024-06-04 16:43:15,440 INFO L125 PetriNetUnfolderBase]: For 36350/36350 co-relation queries the response was YES. [2024-06-04 16:43:15,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 726 events. 416/726 cut-off events. For 36350/36350 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3079 event pairs, 81 based on Foata normal form. 3/728 useless extension candidates. Maximal degree in co-relation 4135. Up to 669 conditions per place. [2024-06-04 16:43:15,445 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 124 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2024-06-04 16:43:15,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1231 flow [2024-06-04 16:43:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:43:15,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 16:43:15,446 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 861 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:43:15,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1231 flow [2024-06-04 16:43:15,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 1192 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 16:43:15,499 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 887 flow [2024-06-04 16:43:15,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2024-06-04 16:43:15,499 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 112 predicate places. [2024-06-04 16:43:15,499 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 887 flow [2024-06-04 16:43:15,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:15,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:15,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:15,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:43:15,500 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:15,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1726697224, now seen corresponding path program 3 times [2024-06-04 16:43:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321603610] [2024-06-04 16:43:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321603610] [2024-06-04 16:43:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321603610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235465493] [2024-06-04 16:43:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:23,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:23,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:23,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 887 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:23,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:23,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:23,672 INFO L124 PetriNetUnfolderBase]: 419/731 cut-off events. [2024-06-04 16:43:23,672 INFO L125 PetriNetUnfolderBase]: For 35656/35656 co-relation queries the response was YES. [2024-06-04 16:43:23,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 731 events. 419/731 cut-off events. For 35656/35656 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3113 event pairs, 82 based on Foata normal form. 1/731 useless extension candidates. Maximal degree in co-relation 4229. Up to 638 conditions per place. [2024-06-04 16:43:23,676 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 100 selfloop transitions, 38 changer transitions 0/140 dead transitions. [2024-06-04 16:43:23,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1235 flow [2024-06-04 16:43:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:43:23,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-04 16:43:23,677 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 887 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:43:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1235 flow [2024-06-04 16:43:23,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 140 transitions, 1186 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:23,733 INFO L231 Difference]: Finished difference. Result has 146 places, 122 transitions, 945 flow [2024-06-04 16:43:23,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=945, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2024-06-04 16:43:23,734 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-04 16:43:23,734 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 945 flow [2024-06-04 16:43:23,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:23,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:23,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:43:23,735 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 910851557, now seen corresponding path program 2 times [2024-06-04 16:43:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427084657] [2024-06-04 16:43:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:29,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427084657] [2024-06-04 16:43:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427084657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:43:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261225859] [2024-06-04 16:43:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:29,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:43:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:43:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:43:29,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:43:29,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 945 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:29,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:29,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:43:29,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:30,288 INFO L124 PetriNetUnfolderBase]: 453/786 cut-off events. [2024-06-04 16:43:30,288 INFO L125 PetriNetUnfolderBase]: For 45638/45638 co-relation queries the response was YES. [2024-06-04 16:43:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 786 events. 453/786 cut-off events. For 45638/45638 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3425 event pairs, 52 based on Foata normal form. 3/788 useless extension candidates. Maximal degree in co-relation 4793. Up to 378 conditions per place. [2024-06-04 16:43:30,293 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 98 selfloop transitions, 60 changer transitions 0/160 dead transitions. [2024-06-04 16:43:30,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 160 transitions, 1621 flow [2024-06-04 16:43:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:43:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:43:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-04 16:43:30,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2024-06-04 16:43:30,295 INFO L175 Difference]: Start difference. First operand has 146 places, 122 transitions, 945 flow. Second operand 9 states and 145 transitions. [2024-06-04 16:43:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 160 transitions, 1621 flow [2024-06-04 16:43:30,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 1530 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:30,351 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 1061 flow [2024-06-04 16:43:30,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1061, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2024-06-04 16:43:30,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 115 predicate places. [2024-06-04 16:43:30,351 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 1061 flow [2024-06-04 16:43:30,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:30,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:30,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:30,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:43:30,352 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:30,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1865231109, now seen corresponding path program 3 times [2024-06-04 16:43:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780659865] [2024-06-04 16:43:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780659865] [2024-06-04 16:43:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780659865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:37,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859237800] [2024-06-04 16:43:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:37,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:37,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:37,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 1061 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:37,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:37,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:37,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:38,154 INFO L124 PetriNetUnfolderBase]: 447/777 cut-off events. [2024-06-04 16:43:38,154 INFO L125 PetriNetUnfolderBase]: For 44181/44181 co-relation queries the response was YES. [2024-06-04 16:43:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 777 events. 447/777 cut-off events. For 44181/44181 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3376 event pairs, 52 based on Foata normal form. 3/779 useless extension candidates. Maximal degree in co-relation 4769. Up to 374 conditions per place. [2024-06-04 16:43:38,159 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 93 selfloop transitions, 62 changer transitions 0/157 dead transitions. [2024-06-04 16:43:38,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 157 transitions, 1551 flow [2024-06-04 16:43:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 16:43:38,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 16:43:38,161 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 1061 flow. Second operand 10 states and 138 transitions. [2024-06-04 16:43:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 157 transitions, 1551 flow [2024-06-04 16:43:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 157 transitions, 1456 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-04 16:43:38,231 INFO L231 Difference]: Finished difference. Result has 153 places, 128 transitions, 1095 flow [2024-06-04 16:43:38,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1095, PETRI_PLACES=153, PETRI_TRANSITIONS=128} [2024-06-04 16:43:38,231 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 121 predicate places. [2024-06-04 16:43:38,231 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 128 transitions, 1095 flow [2024-06-04 16:43:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:38,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:38,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:38,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:43:38,232 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:38,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1054741932, now seen corresponding path program 4 times [2024-06-04 16:43:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452542360] [2024-06-04 16:43:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452542360] [2024-06-04 16:43:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452542360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:45,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:45,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883248625] [2024-06-04 16:43:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:45,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:45,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:45,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 128 transitions, 1095 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:45,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:45,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:45,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:46,092 INFO L124 PetriNetUnfolderBase]: 450/782 cut-off events. [2024-06-04 16:43:46,092 INFO L125 PetriNetUnfolderBase]: For 43258/43258 co-relation queries the response was YES. [2024-06-04 16:43:46,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 782 events. 450/782 cut-off events. For 43258/43258 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3366 event pairs, 95 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 4916. Up to 689 conditions per place. [2024-06-04 16:43:46,098 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2024-06-04 16:43:46,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 145 transitions, 1447 flow [2024-06-04 16:43:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:43:46,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:43:46,100 INFO L175 Difference]: Start difference. First operand has 153 places, 128 transitions, 1095 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:43:46,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 145 transitions, 1447 flow [2024-06-04 16:43:46,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 145 transitions, 1318 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 16:43:46,180 INFO L231 Difference]: Finished difference. Result has 154 places, 130 transitions, 1073 flow [2024-06-04 16:43:46,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1073, PETRI_PLACES=154, PETRI_TRANSITIONS=130} [2024-06-04 16:43:46,181 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-04 16:43:46,181 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 130 transitions, 1073 flow [2024-06-04 16:43:46,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:46,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:46,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:46,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:43:46,181 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:46,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1870795299, now seen corresponding path program 4 times [2024-06-04 16:43:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709507107] [2024-06-04 16:43:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:53,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:53,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709507107] [2024-06-04 16:43:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709507107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:53,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837705161] [2024-06-04 16:43:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:53,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:53,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:53,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:53,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:43:53,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 130 transitions, 1073 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:53,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:53,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:43:53,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:54,083 INFO L124 PetriNetUnfolderBase]: 474/821 cut-off events. [2024-06-04 16:43:54,083 INFO L125 PetriNetUnfolderBase]: For 51476/51476 co-relation queries the response was YES. [2024-06-04 16:43:54,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5276 conditions, 821 events. 474/821 cut-off events. For 51476/51476 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3612 event pairs, 64 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 5198. Up to 399 conditions per place. [2024-06-04 16:43:54,089 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 98 selfloop transitions, 61 changer transitions 0/161 dead transitions. [2024-06-04 16:43:54,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 1721 flow [2024-06-04 16:43:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 16:43:54,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-04 16:43:54,091 INFO L175 Difference]: Start difference. First operand has 154 places, 130 transitions, 1073 flow. Second operand 10 states and 137 transitions. [2024-06-04 16:43:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 1721 flow [2024-06-04 16:43:54,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 161 transitions, 1630 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:54,167 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 1161 flow [2024-06-04 16:43:54,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1161, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2024-06-04 16:43:54,167 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-04 16:43:54,167 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 1161 flow [2024-06-04 16:43:54,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:54,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:54,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:54,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:43:54,168 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:54,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1870587909, now seen corresponding path program 5 times [2024-06-04 16:43:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864397014] [2024-06-04 16:43:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864397014] [2024-06-04 16:44:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864397014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650546614] [2024-06-04 16:44:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:01,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:01,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:01,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 1161 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:01,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:01,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:01,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:02,103 INFO L124 PetriNetUnfolderBase]: 483/836 cut-off events. [2024-06-04 16:44:02,103 INFO L125 PetriNetUnfolderBase]: For 53759/53759 co-relation queries the response was YES. [2024-06-04 16:44:02,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5485 conditions, 836 events. 483/836 cut-off events. For 53759/53759 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3687 event pairs, 62 based on Foata normal form. 3/838 useless extension candidates. Maximal degree in co-relation 5406. Up to 407 conditions per place. [2024-06-04 16:44:02,110 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 102 selfloop transitions, 61 changer transitions 0/165 dead transitions. [2024-06-04 16:44:02,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 1805 flow [2024-06-04 16:44:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-04 16:44:02,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 16:44:02,117 INFO L175 Difference]: Start difference. First operand has 156 places, 134 transitions, 1161 flow. Second operand 10 states and 140 transitions. [2024-06-04 16:44:02,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 1805 flow [2024-06-04 16:44:02,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 165 transitions, 1706 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:44:02,231 INFO L231 Difference]: Finished difference. Result has 160 places, 136 transitions, 1219 flow [2024-06-04 16:44:02,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1219, PETRI_PLACES=160, PETRI_TRANSITIONS=136} [2024-06-04 16:44:02,231 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2024-06-04 16:44:02,231 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 136 transitions, 1219 flow [2024-06-04 16:44:02,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:02,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:02,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:44:02,239 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:02,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1054747667, now seen corresponding path program 6 times [2024-06-04 16:44:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726095057] [2024-06-04 16:44:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726095057] [2024-06-04 16:44:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726095057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243963681] [2024-06-04 16:44:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:09,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:09,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:09,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 136 transitions, 1219 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:09,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:09,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:09,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:09,990 INFO L124 PetriNetUnfolderBase]: 477/827 cut-off events. [2024-06-04 16:44:09,990 INFO L125 PetriNetUnfolderBase]: For 51781/51781 co-relation queries the response was YES. [2024-06-04 16:44:09,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 827 events. 477/827 cut-off events. For 51781/51781 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3652 event pairs, 64 based on Foata normal form. 3/829 useless extension candidates. Maximal degree in co-relation 5246. Up to 403 conditions per place. [2024-06-04 16:44:09,996 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 102 selfloop transitions, 60 changer transitions 0/164 dead transitions. [2024-06-04 16:44:09,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 1727 flow [2024-06-04 16:44:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-04 16:44:09,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 16:44:09,998 INFO L175 Difference]: Start difference. First operand has 160 places, 136 transitions, 1219 flow. Second operand 10 states and 140 transitions. [2024-06-04 16:44:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 1727 flow [2024-06-04 16:44:10,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 1585 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:44:10,089 INFO L231 Difference]: Finished difference. Result has 163 places, 136 transitions, 1202 flow [2024-06-04 16:44:10,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1202, PETRI_PLACES=163, PETRI_TRANSITIONS=136} [2024-06-04 16:44:10,090 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-04 16:44:10,090 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1202 flow [2024-06-04 16:44:10,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:10,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:10,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:10,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:44:10,091 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:10,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671877, now seen corresponding path program 7 times [2024-06-04 16:44:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919160074] [2024-06-04 16:44:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919160074] [2024-06-04 16:44:17,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919160074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:17,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:17,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489120254] [2024-06-04 16:44:17,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:17,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:17,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:17,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1202 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:17,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:17,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:17,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:18,271 INFO L124 PetriNetUnfolderBase]: 501/866 cut-off events. [2024-06-04 16:44:18,271 INFO L125 PetriNetUnfolderBase]: For 58237/58237 co-relation queries the response was YES. [2024-06-04 16:44:18,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 866 events. 501/866 cut-off events. For 58237/58237 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3852 event pairs, 92 based on Foata normal form. 3/868 useless extension candidates. Maximal degree in co-relation 5611. Up to 423 conditions per place. [2024-06-04 16:44:18,277 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 100 selfloop transitions, 64 changer transitions 0/166 dead transitions. [2024-06-04 16:44:18,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 1880 flow [2024-06-04 16:44:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 16:44:18,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 16:44:18,278 INFO L175 Difference]: Start difference. First operand has 163 places, 136 transitions, 1202 flow. Second operand 10 states and 138 transitions. [2024-06-04 16:44:18,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 1880 flow [2024-06-04 16:44:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 1726 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 16:44:18,372 INFO L231 Difference]: Finished difference. Result has 163 places, 140 transitions, 1245 flow [2024-06-04 16:44:18,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1245, PETRI_PLACES=163, PETRI_TRANSITIONS=140} [2024-06-04 16:44:18,372 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-04 16:44:18,372 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 140 transitions, 1245 flow [2024-06-04 16:44:18,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:18,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:18,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:44:18,373 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:18,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671722, now seen corresponding path program 5 times [2024-06-04 16:44:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122297232] [2024-06-04 16:44:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122297232] [2024-06-04 16:44:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122297232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492553518] [2024-06-04 16:44:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:26,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:26,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:26,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 140 transitions, 1245 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:26,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:26,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:26,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:27,000 INFO L124 PetriNetUnfolderBase]: 504/871 cut-off events. [2024-06-04 16:44:27,000 INFO L125 PetriNetUnfolderBase]: For 57123/57123 co-relation queries the response was YES. [2024-06-04 16:44:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 871 events. 504/871 cut-off events. For 57123/57123 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3877 event pairs, 109 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 5672. Up to 778 conditions per place. [2024-06-04 16:44:27,007 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 117 selfloop transitions, 35 changer transitions 0/154 dead transitions. [2024-06-04 16:44:27,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 154 transitions, 1609 flow [2024-06-04 16:44:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:44:27,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-04 16:44:27,008 INFO L175 Difference]: Start difference. First operand has 163 places, 140 transitions, 1245 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:44:27,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 154 transitions, 1609 flow [2024-06-04 16:44:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 1493 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:44:27,118 INFO L231 Difference]: Finished difference. Result has 167 places, 142 transitions, 1238 flow [2024-06-04 16:44:27,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1238, PETRI_PLACES=167, PETRI_TRANSITIONS=142} [2024-06-04 16:44:27,118 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-04 16:44:27,118 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 142 transitions, 1238 flow [2024-06-04 16:44:27,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:27,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:27,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:44:27,119 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:27,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1372154513, now seen corresponding path program 8 times [2024-06-04 16:44:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648469976] [2024-06-04 16:44:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648469976] [2024-06-04 16:44:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648469976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:34,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:34,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520828282] [2024-06-04 16:44:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:34,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:34,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:34,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 142 transitions, 1238 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:34,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:34,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:34,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:35,230 INFO L124 PetriNetUnfolderBase]: 513/886 cut-off events. [2024-06-04 16:44:35,230 INFO L125 PetriNetUnfolderBase]: For 62196/62196 co-relation queries the response was YES. [2024-06-04 16:44:35,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 886 events. 513/886 cut-off events. For 62196/62196 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3975 event pairs, 92 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 5679. Up to 436 conditions per place. [2024-06-04 16:44:35,237 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 104 selfloop transitions, 64 changer transitions 0/170 dead transitions. [2024-06-04 16:44:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 170 transitions, 1896 flow [2024-06-04 16:44:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-04 16:44:35,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-04 16:44:35,239 INFO L175 Difference]: Start difference. First operand has 167 places, 142 transitions, 1238 flow. Second operand 10 states and 139 transitions. [2024-06-04 16:44:35,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 170 transitions, 1896 flow [2024-06-04 16:44:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 1803 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:44:35,342 INFO L231 Difference]: Finished difference. Result has 169 places, 144 transitions, 1306 flow [2024-06-04 16:44:35,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1306, PETRI_PLACES=169, PETRI_TRANSITIONS=144} [2024-06-04 16:44:35,343 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2024-06-04 16:44:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 1306 flow [2024-06-04 16:44:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:35,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:35,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:44:35,344 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:35,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1371952703, now seen corresponding path program 9 times [2024-06-04 16:44:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10876845] [2024-06-04 16:44:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10876845] [2024-06-04 16:44:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10876845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:42,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220843273] [2024-06-04 16:44:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:42,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:42,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:44:42,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 1306 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:42,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:42,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:44:42,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:43,389 INFO L124 PetriNetUnfolderBase]: 522/901 cut-off events. [2024-06-04 16:44:43,390 INFO L125 PetriNetUnfolderBase]: For 64831/64831 co-relation queries the response was YES. [2024-06-04 16:44:43,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 901 events. 522/901 cut-off events. For 64831/64831 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4038 event pairs, 96 based on Foata normal form. 3/903 useless extension candidates. Maximal degree in co-relation 5901. Up to 444 conditions per place. [2024-06-04 16:44:43,399 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 65 changer transitions 0/172 dead transitions. [2024-06-04 16:44:43,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 1976 flow [2024-06-04 16:44:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:44:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:44:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-04 16:44:43,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 16:44:43,404 INFO L175 Difference]: Start difference. First operand has 169 places, 144 transitions, 1306 flow. Second operand 10 states and 140 transitions. [2024-06-04 16:44:43,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 1976 flow [2024-06-04 16:44:43,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 172 transitions, 1843 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:44:43,532 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 1340 flow [2024-06-04 16:44:43,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1340, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2024-06-04 16:44:43,533 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-04 16:44:43,533 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 1340 flow [2024-06-04 16:44:43,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:43,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:43,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:43,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:44:43,534 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:43,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1364525816, now seen corresponding path program 1 times [2024-06-04 16:44:43,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:43,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414244412] [2024-06-04 16:44:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414244412] [2024-06-04 16:44:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414244412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:51,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:44:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672008956] [2024-06-04 16:44:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:44:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:44:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:44:52,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:44:52,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 146 transitions, 1340 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:52,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:52,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:44:52,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:52,471 INFO L124 PetriNetUnfolderBase]: 471/836 cut-off events. [2024-06-04 16:44:52,471 INFO L125 PetriNetUnfolderBase]: For 68606/68615 co-relation queries the response was YES. [2024-06-04 16:44:52,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 836 events. 471/836 cut-off events. For 68606/68615 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3896 event pairs, 74 based on Foata normal form. 5/828 useless extension candidates. Maximal degree in co-relation 5671. Up to 736 conditions per place. [2024-06-04 16:44:52,478 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 129 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2024-06-04 16:44:52,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 164 transitions, 1702 flow [2024-06-04 16:44:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:44:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:44:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 16:44:52,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-04 16:44:52,480 INFO L175 Difference]: Start difference. First operand has 172 places, 146 transitions, 1340 flow. Second operand 9 states and 116 transitions. [2024-06-04 16:44:52,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 164 transitions, 1702 flow [2024-06-04 16:44:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 164 transitions, 1568 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:44:52,589 INFO L231 Difference]: Finished difference. Result has 175 places, 149 transitions, 1283 flow [2024-06-04 16:44:52,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1283, PETRI_PLACES=175, PETRI_TRANSITIONS=149} [2024-06-04 16:44:52,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-04 16:44:52,590 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 149 transitions, 1283 flow [2024-06-04 16:44:52,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:52,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:52,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:52,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:44:52,590 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:52,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1364802863, now seen corresponding path program 10 times [2024-06-04 16:44:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191831923] [2024-06-04 16:44:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191831923] [2024-06-04 16:45:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191831923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443604933] [2024-06-04 16:45:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:00,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:00,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 149 transitions, 1283 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:00,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:00,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:00,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:00,849 INFO L124 PetriNetUnfolderBase]: 520/900 cut-off events. [2024-06-04 16:45:00,850 INFO L125 PetriNetUnfolderBase]: For 63855/63855 co-relation queries the response was YES. [2024-06-04 16:45:00,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 900 events. 520/900 cut-off events. For 63855/63855 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4081 event pairs, 104 based on Foata normal form. 3/902 useless extension candidates. Maximal degree in co-relation 5703. Up to 448 conditions per place. [2024-06-04 16:45:00,855 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 98 selfloop transitions, 72 changer transitions 0/172 dead transitions. [2024-06-04 16:45:00,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 172 transitions, 1813 flow [2024-06-04 16:45:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 16:45:00,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-04 16:45:00,857 INFO L175 Difference]: Start difference. First operand has 175 places, 149 transitions, 1283 flow. Second operand 10 states and 134 transitions. [2024-06-04 16:45:00,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 172 transitions, 1813 flow [2024-06-04 16:45:00,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 172 transitions, 1751 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:00,963 INFO L231 Difference]: Finished difference. Result has 179 places, 149 transitions, 1370 flow [2024-06-04 16:45:00,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1370, PETRI_PLACES=179, PETRI_TRANSITIONS=149} [2024-06-04 16:45:00,965 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-04 16:45:00,965 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 149 transitions, 1370 flow [2024-06-04 16:45:00,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:00,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:00,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:45:00,966 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:00,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 574223831, now seen corresponding path program 11 times [2024-06-04 16:45:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217189138] [2024-06-04 16:45:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217189138] [2024-06-04 16:45:08,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217189138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:08,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:08,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920257194] [2024-06-04 16:45:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:08,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:08,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:08,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:08,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 149 transitions, 1370 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:08,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:08,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:09,318 INFO L124 PetriNetUnfolderBase]: 544/939 cut-off events. [2024-06-04 16:45:09,318 INFO L125 PetriNetUnfolderBase]: For 72070/72070 co-relation queries the response was YES. [2024-06-04 16:45:09,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 939 events. 544/939 cut-off events. For 72070/72070 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4306 event pairs, 86 based on Foata normal form. 3/941 useless extension candidates. Maximal degree in co-relation 6245. Up to 754 conditions per place. [2024-06-04 16:45:09,325 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 138 selfloop transitions, 34 changer transitions 0/174 dead transitions. [2024-06-04 16:45:09,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 2086 flow [2024-06-04 16:45:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:45:09,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-04 16:45:09,327 INFO L175 Difference]: Start difference. First operand has 179 places, 149 transitions, 1370 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:45:09,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 2086 flow [2024-06-04 16:45:09,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 174 transitions, 1900 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-04 16:45:09,453 INFO L231 Difference]: Finished difference. Result has 178 places, 153 transitions, 1325 flow [2024-06-04 16:45:09,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1325, PETRI_PLACES=178, PETRI_TRANSITIONS=153} [2024-06-04 16:45:09,455 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-04 16:45:09,455 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 153 transitions, 1325 flow [2024-06-04 16:45:09,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:09,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:09,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:09,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:45:09,455 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:09,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash -621083951, now seen corresponding path program 12 times [2024-06-04 16:45:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:09,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125978630] [2024-06-04 16:45:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125978630] [2024-06-04 16:45:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125978630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146656468] [2024-06-04 16:45:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:16,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:17,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:17,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 153 transitions, 1325 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:17,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:17,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:17,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:17,482 INFO L124 PetriNetUnfolderBase]: 568/978 cut-off events. [2024-06-04 16:45:17,483 INFO L125 PetriNetUnfolderBase]: For 80057/80057 co-relation queries the response was YES. [2024-06-04 16:45:17,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6619 conditions, 978 events. 568/978 cut-off events. For 80057/80057 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4523 event pairs, 114 based on Foata normal form. 3/980 useless extension candidates. Maximal degree in co-relation 6530. Up to 774 conditions per place. [2024-06-04 16:45:17,490 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 141 selfloop transitions, 35 changer transitions 0/178 dead transitions. [2024-06-04 16:45:17,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 178 transitions, 2053 flow [2024-06-04 16:45:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 16:45:17,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-04 16:45:17,491 INFO L175 Difference]: Start difference. First operand has 178 places, 153 transitions, 1325 flow. Second operand 10 states and 127 transitions. [2024-06-04 16:45:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 178 transitions, 2053 flow [2024-06-04 16:45:17,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 178 transitions, 1861 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:45:17,656 INFO L231 Difference]: Finished difference. Result has 179 places, 157 transitions, 1276 flow [2024-06-04 16:45:17,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=179, PETRI_TRANSITIONS=157} [2024-06-04 16:45:17,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-04 16:45:17,657 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 157 transitions, 1276 flow [2024-06-04 16:45:17,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:17,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:17,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:17,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:45:17,657 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:17,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash -620806904, now seen corresponding path program 2 times [2024-06-04 16:45:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315005004] [2024-06-04 16:45:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:25,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-04 16:45:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315005004] [2024-06-04 16:45:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315005004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:25,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887316803] [2024-06-04 16:45:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:25,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:25,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:25,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:45:25,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 157 transitions, 1276 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:25,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:25,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:45:25,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:26,368 INFO L124 PetriNetUnfolderBase]: 520/914 cut-off events. [2024-06-04 16:45:26,369 INFO L125 PetriNetUnfolderBase]: For 85050/85060 co-relation queries the response was YES. [2024-06-04 16:45:26,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 914 events. 520/914 cut-off events. For 85050/85060 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4353 event pairs, 83 based on Foata normal form. 6/904 useless extension candidates. Maximal degree in co-relation 6221. Up to 830 conditions per place. [2024-06-04 16:45:26,377 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 142 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2024-06-04 16:45:26,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 1675 flow [2024-06-04 16:45:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:45:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:45:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:45:26,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-04 16:45:26,382 INFO L175 Difference]: Start difference. First operand has 179 places, 157 transitions, 1276 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:45:26,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 176 transitions, 1675 flow [2024-06-04 16:45:26,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 1614 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:26,545 INFO L231 Difference]: Finished difference. Result has 185 places, 164 transitions, 1333 flow [2024-06-04 16:45:26,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1333, PETRI_PLACES=185, PETRI_TRANSITIONS=164} [2024-06-04 16:45:26,547 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2024-06-04 16:45:26,547 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 164 transitions, 1333 flow [2024-06-04 16:45:26,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:26,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:26,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:26,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:45:26,547 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:26,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1158212041, now seen corresponding path program 13 times [2024-06-04 16:45:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178715710] [2024-06-04 16:45:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178715710] [2024-06-04 16:45:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178715710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451134139] [2024-06-04 16:45:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:33,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:33,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:33,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:33,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 164 transitions, 1333 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:33,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:33,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:34,366 INFO L124 PetriNetUnfolderBase]: 569/982 cut-off events. [2024-06-04 16:45:34,366 INFO L125 PetriNetUnfolderBase]: For 78554/78554 co-relation queries the response was YES. [2024-06-04 16:45:34,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 982 events. 569/982 cut-off events. For 78554/78554 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4570 event pairs, 88 based on Foata normal form. 3/984 useless extension candidates. Maximal degree in co-relation 6448. Up to 783 conditions per place. [2024-06-04 16:45:34,377 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 146 selfloop transitions, 37 changer transitions 0/185 dead transitions. [2024-06-04 16:45:34,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 185 transitions, 2035 flow [2024-06-04 16:45:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:45:34,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2024-06-04 16:45:34,379 INFO L175 Difference]: Start difference. First operand has 185 places, 164 transitions, 1333 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:45:34,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 185 transitions, 2035 flow [2024-06-04 16:45:34,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 185 transitions, 1999 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 16:45:34,534 INFO L231 Difference]: Finished difference. Result has 191 places, 164 transitions, 1376 flow [2024-06-04 16:45:34,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1376, PETRI_PLACES=191, PETRI_TRANSITIONS=164} [2024-06-04 16:45:34,536 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2024-06-04 16:45:34,536 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 164 transitions, 1376 flow [2024-06-04 16:45:34,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:34,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:34,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:45:34,537 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:34,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1398919163, now seen corresponding path program 14 times [2024-06-04 16:45:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:34,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281203168] [2024-06-04 16:45:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:42,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281203168] [2024-06-04 16:45:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281203168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555636799] [2024-06-04 16:45:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:42,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:42,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 164 transitions, 1376 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:42,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:42,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:42,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:42,980 INFO L124 PetriNetUnfolderBase]: 563/973 cut-off events. [2024-06-04 16:45:42,980 INFO L125 PetriNetUnfolderBase]: For 75081/75081 co-relation queries the response was YES. [2024-06-04 16:45:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 973 events. 563/973 cut-off events. For 75081/75081 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4518 event pairs, 82 based on Foata normal form. 3/975 useless extension candidates. Maximal degree in co-relation 6310. Up to 779 conditions per place. [2024-06-04 16:45:42,988 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 140 selfloop transitions, 42 changer transitions 0/184 dead transitions. [2024-06-04 16:45:42,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 184 transitions, 1950 flow [2024-06-04 16:45:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:45:42,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-04 16:45:42,990 INFO L175 Difference]: Start difference. First operand has 191 places, 164 transitions, 1376 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:45:42,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 184 transitions, 1950 flow [2024-06-04 16:45:43,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 184 transitions, 1849 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:45:43,142 INFO L231 Difference]: Finished difference. Result has 193 places, 164 transitions, 1364 flow [2024-06-04 16:45:43,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1364, PETRI_PLACES=193, PETRI_TRANSITIONS=164} [2024-06-04 16:45:43,142 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-04 16:45:43,143 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 164 transitions, 1364 flow [2024-06-04 16:45:43,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:43,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:43,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:43,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:45:43,143 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:43,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -628441336, now seen corresponding path program 6 times [2024-06-04 16:45:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327663017] [2024-06-04 16:45:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327663017] [2024-06-04 16:45:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327663017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035284727] [2024-06-04 16:45:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:51,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:51,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:51,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 164 transitions, 1364 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:51,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:51,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:51,803 INFO L124 PetriNetUnfolderBase]: 561/970 cut-off events. [2024-06-04 16:45:51,803 INFO L125 PetriNetUnfolderBase]: For 70801/70801 co-relation queries the response was YES. [2024-06-04 16:45:51,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6349 conditions, 970 events. 561/970 cut-off events. For 70801/70801 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4488 event pairs, 114 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 6253. Up to 943 conditions per place. [2024-06-04 16:45:51,809 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2024-06-04 16:45:51,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 175 transitions, 1764 flow [2024-06-04 16:45:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 16:45:51,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-04 16:45:51,828 INFO L175 Difference]: Start difference. First operand has 193 places, 164 transitions, 1364 flow. Second operand 10 states and 107 transitions. [2024-06-04 16:45:51,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 175 transitions, 1764 flow [2024-06-04 16:45:51,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 1688 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 16:45:51,995 INFO L231 Difference]: Finished difference. Result has 195 places, 166 transitions, 1365 flow [2024-06-04 16:45:51,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1365, PETRI_PLACES=195, PETRI_TRANSITIONS=166} [2024-06-04 16:45:51,996 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-04 16:45:51,996 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 166 transitions, 1365 flow [2024-06-04 16:45:51,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:51,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:51,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:51,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:45:51,996 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:51,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash -372922573, now seen corresponding path program 15 times [2024-06-04 16:45:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:51,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823368163] [2024-06-04 16:45:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823368163] [2024-06-04 16:45:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823368163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:45:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384367303] [2024-06-04 16:45:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:45:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:45:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:45:59,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:45:59,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 166 transitions, 1365 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:59,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:59,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:45:59,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:59,740 INFO L124 PetriNetUnfolderBase]: 555/961 cut-off events. [2024-06-04 16:45:59,741 INFO L125 PetriNetUnfolderBase]: For 70592/70592 co-relation queries the response was YES. [2024-06-04 16:45:59,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6078 conditions, 961 events. 555/961 cut-off events. For 70592/70592 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4457 event pairs, 102 based on Foata normal form. 3/963 useless extension candidates. Maximal degree in co-relation 5981. Up to 898 conditions per place. [2024-06-04 16:45:59,749 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 164 selfloop transitions, 17 changer transitions 0/183 dead transitions. [2024-06-04 16:45:59,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 183 transitions, 1795 flow [2024-06-04 16:45:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:45:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:45:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:45:59,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-04 16:45:59,750 INFO L175 Difference]: Start difference. First operand has 195 places, 166 transitions, 1365 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:45:59,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 183 transitions, 1795 flow [2024-06-04 16:45:59,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 1720 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-04 16:45:59,895 INFO L231 Difference]: Finished difference. Result has 197 places, 166 transitions, 1329 flow [2024-06-04 16:45:59,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=197, PETRI_TRANSITIONS=166} [2024-06-04 16:45:59,896 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-04 16:45:59,896 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 166 transitions, 1329 flow [2024-06-04 16:45:59,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:59,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:59,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:59,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:45:59,897 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:45:59,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -371456234, now seen corresponding path program 3 times [2024-06-04 16:45:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:59,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772652190] [2024-06-04 16:45:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:07,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772652190] [2024-06-04 16:46:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772652190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:07,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:46:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168996859] [2024-06-04 16:46:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:07,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:46:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:46:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:46:08,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:46:08,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 166 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:08,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:08,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:46:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:08,463 INFO L124 PetriNetUnfolderBase]: 504/888 cut-off events. [2024-06-04 16:46:08,463 INFO L125 PetriNetUnfolderBase]: For 79173/79182 co-relation queries the response was YES. [2024-06-04 16:46:08,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 888 events. 504/888 cut-off events. For 79173/79182 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4230 event pairs, 82 based on Foata normal form. 9/883 useless extension candidates. Maximal degree in co-relation 5678. Up to 820 conditions per place. [2024-06-04 16:46:08,471 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 149 selfloop transitions, 17 changer transitions 0/180 dead transitions. [2024-06-04 16:46:08,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 180 transitions, 1723 flow [2024-06-04 16:46:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:46:08,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-04 16:46:08,473 INFO L175 Difference]: Start difference. First operand has 197 places, 166 transitions, 1329 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:46:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 180 transitions, 1723 flow [2024-06-04 16:46:08,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 180 transitions, 1628 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-04 16:46:08,627 INFO L231 Difference]: Finished difference. Result has 195 places, 169 transitions, 1316 flow [2024-06-04 16:46:08,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1316, PETRI_PLACES=195, PETRI_TRANSITIONS=169} [2024-06-04 16:46:08,628 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-04 16:46:08,628 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 169 transitions, 1316 flow [2024-06-04 16:46:08,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:08,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:08,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:08,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:46:08,629 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:08,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -58946296, now seen corresponding path program 4 times [2024-06-04 16:46:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335783630] [2024-06-04 16:46:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335783630] [2024-06-04 16:46:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335783630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:46:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918903531] [2024-06-04 16:46:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:16,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:46:16,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:16,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:46:16,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:46:16,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:46:16,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 169 transitions, 1316 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:16,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:16,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:46:16,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:17,062 INFO L124 PetriNetUnfolderBase]: 508/896 cut-off events. [2024-06-04 16:46:17,063 INFO L125 PetriNetUnfolderBase]: For 80445/80453 co-relation queries the response was YES. [2024-06-04 16:46:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 896 events. 508/896 cut-off events. For 80445/80453 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4281 event pairs, 84 based on Foata normal form. 8/888 useless extension candidates. Maximal degree in co-relation 5772. Up to 829 conditions per place. [2024-06-04 16:46:17,070 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 149 selfloop transitions, 17 changer transitions 0/180 dead transitions. [2024-06-04 16:46:17,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 180 transitions, 1688 flow [2024-06-04 16:46:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:46:17,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:46:17,072 INFO L175 Difference]: Start difference. First operand has 195 places, 169 transitions, 1316 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:46:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 180 transitions, 1688 flow [2024-06-04 16:46:17,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 180 transitions, 1636 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 16:46:17,224 INFO L231 Difference]: Finished difference. Result has 198 places, 170 transitions, 1321 flow [2024-06-04 16:46:17,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=198, PETRI_TRANSITIONS=170} [2024-06-04 16:46:17,225 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 166 predicate places. [2024-06-04 16:46:17,225 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 170 transitions, 1321 flow [2024-06-04 16:46:17,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:17,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:17,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:17,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 16:46:17,225 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:17,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -588934466, now seen corresponding path program 1 times [2024-06-04 16:46:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863600668] [2024-06-04 16:46:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863600668] [2024-06-04 16:46:24,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863600668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:24,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:46:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227001207] [2024-06-04 16:46:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:46:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:46:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:46:24,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:46:24,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 170 transitions, 1321 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:24,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:24,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:46:24,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:24,862 INFO L124 PetriNetUnfolderBase]: 559/971 cut-off events. [2024-06-04 16:46:24,862 INFO L125 PetriNetUnfolderBase]: For 69948/69948 co-relation queries the response was YES. [2024-06-04 16:46:24,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 971 events. 559/971 cut-off events. For 69948/69948 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4530 event pairs, 100 based on Foata normal form. 2/972 useless extension candidates. Maximal degree in co-relation 5956. Up to 923 conditions per place. [2024-06-04 16:46:24,870 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 20 changer transitions 0/184 dead transitions. [2024-06-04 16:46:24,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 1741 flow [2024-06-04 16:46:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:46:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:46:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 16:46:24,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-04 16:46:24,871 INFO L175 Difference]: Start difference. First operand has 198 places, 170 transitions, 1321 flow. Second operand 10 states and 111 transitions. [2024-06-04 16:46:24,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 184 transitions, 1741 flow [2024-06-04 16:46:25,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 184 transitions, 1696 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 16:46:25,023 INFO L231 Difference]: Finished difference. Result has 201 places, 172 transitions, 1349 flow [2024-06-04 16:46:25,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=201, PETRI_TRANSITIONS=172} [2024-06-04 16:46:25,023 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-04 16:46:25,024 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 172 transitions, 1349 flow [2024-06-04 16:46:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:25,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:25,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:25,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 16:46:25,024 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:25,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -577496706, now seen corresponding path program 5 times [2024-06-04 16:46:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020617995] [2024-06-04 16:46:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020617995] [2024-06-04 16:46:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020617995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:32,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:46:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743084877] [2024-06-04 16:46:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:46:32,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:46:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:46:32,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:46:32,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 172 transitions, 1349 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:32,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:32,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:46:32,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:33,016 INFO L124 PetriNetUnfolderBase]: 501/891 cut-off events. [2024-06-04 16:46:33,016 INFO L125 PetriNetUnfolderBase]: For 74249/74254 co-relation queries the response was YES. [2024-06-04 16:46:33,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 891 events. 501/891 cut-off events. For 74249/74254 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4281 event pairs, 80 based on Foata normal form. 7/887 useless extension candidates. Maximal degree in co-relation 5507. Up to 821 conditions per place. [2024-06-04 16:46:33,024 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 154 selfloop transitions, 14 changer transitions 0/182 dead transitions. [2024-06-04 16:46:33,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 182 transitions, 1707 flow [2024-06-04 16:46:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:46:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:46:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:46:33,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-04 16:46:33,026 INFO L175 Difference]: Start difference. First operand has 201 places, 172 transitions, 1349 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:46:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 182 transitions, 1707 flow [2024-06-04 16:46:33,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 182 transitions, 1650 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:46:33,168 INFO L231 Difference]: Finished difference. Result has 202 places, 172 transitions, 1324 flow [2024-06-04 16:46:33,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=202, PETRI_TRANSITIONS=172} [2024-06-04 16:46:33,169 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-04 16:46:33,169 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 172 transitions, 1324 flow [2024-06-04 16:46:33,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:33,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:33,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 16:46:33,170 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:33,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1946524688, now seen corresponding path program 1 times [2024-06-04 16:46:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343069945] [2024-06-04 16:46:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343069945] [2024-06-04 16:46:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343069945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:46:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201667653] [2024-06-04 16:46:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:46:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:46:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:46:41,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:46:41,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 172 transitions, 1324 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:41,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:41,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:46:41,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:42,544 INFO L124 PetriNetUnfolderBase]: 567/987 cut-off events. [2024-06-04 16:46:42,545 INFO L125 PetriNetUnfolderBase]: For 74176/74176 co-relation queries the response was YES. [2024-06-04 16:46:42,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 987 events. 567/987 cut-off events. For 74176/74176 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4639 event pairs, 88 based on Foata normal form. 2/988 useless extension candidates. Maximal degree in co-relation 6114. Up to 887 conditions per place. [2024-06-04 16:46:42,554 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 23 changer transitions 0/203 dead transitions. [2024-06-04 16:46:42,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 203 transitions, 1996 flow [2024-06-04 16:46:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:46:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:46:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-04 16:46:42,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35858585858585856 [2024-06-04 16:46:42,556 INFO L175 Difference]: Start difference. First operand has 202 places, 172 transitions, 1324 flow. Second operand 12 states and 142 transitions. [2024-06-04 16:46:42,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 203 transitions, 1996 flow [2024-06-04 16:46:42,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 203 transitions, 1931 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:46:42,744 INFO L231 Difference]: Finished difference. Result has 206 places, 174 transitions, 1359 flow [2024-06-04 16:46:42,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1359, PETRI_PLACES=206, PETRI_TRANSITIONS=174} [2024-06-04 16:46:42,745 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 174 predicate places. [2024-06-04 16:46:42,745 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 174 transitions, 1359 flow [2024-06-04 16:46:42,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:42,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:42,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:42,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 16:46:42,746 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:42,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1869919764, now seen corresponding path program 2 times [2024-06-04 16:46:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624292581] [2024-06-04 16:46:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:46:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:46:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:46:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624292581] [2024-06-04 16:46:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624292581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:46:51,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:46:51,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:46:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318154783] [2024-06-04 16:46:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:46:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:46:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:46:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:46:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:46:51,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:46:51,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 174 transitions, 1359 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:51,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:46:51,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:46:51,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:46:52,313 INFO L124 PetriNetUnfolderBase]: 571/995 cut-off events. [2024-06-04 16:46:52,313 INFO L125 PetriNetUnfolderBase]: For 76377/76377 co-relation queries the response was YES. [2024-06-04 16:46:52,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 995 events. 571/995 cut-off events. For 76377/76377 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4714 event pairs, 105 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 6207. Up to 926 conditions per place. [2024-06-04 16:46:52,322 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 22 changer transitions 0/202 dead transitions. [2024-06-04 16:46:52,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 202 transitions, 1861 flow [2024-06-04 16:46:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:46:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:46:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 16:46:52,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-04 16:46:52,325 INFO L175 Difference]: Start difference. First operand has 206 places, 174 transitions, 1359 flow. Second operand 12 states and 141 transitions. [2024-06-04 16:46:52,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 202 transitions, 1861 flow [2024-06-04 16:46:52,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 202 transitions, 1765 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-04 16:46:52,484 INFO L231 Difference]: Finished difference. Result has 208 places, 175 transitions, 1339 flow [2024-06-04 16:46:52,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1339, PETRI_PLACES=208, PETRI_TRANSITIONS=175} [2024-06-04 16:46:52,485 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-04 16:46:52,485 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 175 transitions, 1339 flow [2024-06-04 16:46:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:46:52,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:46:52,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:46:52,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 16:46:52,485 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:46:52,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:46:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1869919888, now seen corresponding path program 1 times [2024-06-04 16:46:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:46:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101217227] [2024-06-04 16:46:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:46:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:46:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:01,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-04 16:47:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101217227] [2024-06-04 16:47:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101217227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616000932] [2024-06-04 16:47:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:01,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:01,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 175 transitions, 1339 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:01,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:01,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:01,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:02,389 INFO L124 PetriNetUnfolderBase]: 589/1024 cut-off events. [2024-06-04 16:47:02,389 INFO L125 PetriNetUnfolderBase]: For 84001/84001 co-relation queries the response was YES. [2024-06-04 16:47:02,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1024 events. 589/1024 cut-off events. For 84001/84001 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4872 event pairs, 104 based on Foata normal form. 1/1024 useless extension candidates. Maximal degree in co-relation 6501. Up to 932 conditions per place. [2024-06-04 16:47:02,398 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 182 selfloop transitions, 26 changer transitions 0/210 dead transitions. [2024-06-04 16:47:02,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 210 transitions, 2061 flow [2024-06-04 16:47:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:47:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:47:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-04 16:47:02,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-04 16:47:02,399 INFO L175 Difference]: Start difference. First operand has 208 places, 175 transitions, 1339 flow. Second operand 12 states and 148 transitions. [2024-06-04 16:47:02,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 210 transitions, 2061 flow [2024-06-04 16:47:02,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 210 transitions, 2007 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 16:47:02,582 INFO L231 Difference]: Finished difference. Result has 211 places, 180 transitions, 1425 flow [2024-06-04 16:47:02,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1425, PETRI_PLACES=211, PETRI_TRANSITIONS=180} [2024-06-04 16:47:02,583 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-04 16:47:02,583 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 180 transitions, 1425 flow [2024-06-04 16:47:02,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:02,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:02,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:02,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 16:47:02,584 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:02,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -554574554, now seen corresponding path program 3 times [2024-06-04 16:47:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079394998] [2024-06-04 16:47:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079394998] [2024-06-04 16:47:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079394998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:11,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309322468] [2024-06-04 16:47:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:11,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:11,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:11,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 180 transitions, 1425 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:11,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:11,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:11,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:12,134 INFO L124 PetriNetUnfolderBase]: 586/1019 cut-off events. [2024-06-04 16:47:12,134 INFO L125 PetriNetUnfolderBase]: For 84136/84136 co-relation queries the response was YES. [2024-06-04 16:47:12,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 1019 events. 586/1019 cut-off events. For 84136/84136 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4830 event pairs, 106 based on Foata normal form. 2/1020 useless extension candidates. Maximal degree in co-relation 6551. Up to 962 conditions per place. [2024-06-04 16:47:12,144 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 183 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-06-04 16:47:12,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 203 transitions, 1891 flow [2024-06-04 16:47:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 16:47:12,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3526170798898072 [2024-06-04 16:47:12,145 INFO L175 Difference]: Start difference. First operand has 211 places, 180 transitions, 1425 flow. Second operand 11 states and 128 transitions. [2024-06-04 16:47:12,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 203 transitions, 1891 flow [2024-06-04 16:47:12,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 203 transitions, 1819 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 16:47:12,328 INFO L231 Difference]: Finished difference. Result has 214 places, 180 transitions, 1393 flow [2024-06-04 16:47:12,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=214, PETRI_TRANSITIONS=180} [2024-06-04 16:47:12,328 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 182 predicate places. [2024-06-04 16:47:12,328 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 180 transitions, 1393 flow [2024-06-04 16:47:12,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:12,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:12,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 16:47:12,329 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:12,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1872721048, now seen corresponding path program 2 times [2024-06-04 16:47:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:12,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209700146] [2024-06-04 16:47:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209700146] [2024-06-04 16:47:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209700146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:20,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058468810] [2024-06-04 16:47:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:20,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:21,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:21,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 180 transitions, 1393 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:21,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:21,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:21,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:21,755 INFO L124 PetriNetUnfolderBase]: 585/1018 cut-off events. [2024-06-04 16:47:21,755 INFO L125 PetriNetUnfolderBase]: For 83302/83302 co-relation queries the response was YES. [2024-06-04 16:47:21,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6493 conditions, 1018 events. 585/1018 cut-off events. For 83302/83302 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4839 event pairs, 103 based on Foata normal form. 3/1020 useless extension candidates. Maximal degree in co-relation 6385. Up to 950 conditions per place. [2024-06-04 16:47:21,764 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 185 selfloop transitions, 20 changer transitions 0/207 dead transitions. [2024-06-04 16:47:21,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 207 transitions, 1909 flow [2024-06-04 16:47:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:47:21,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:47:21,765 INFO L175 Difference]: Start difference. First operand has 214 places, 180 transitions, 1393 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:47:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 207 transitions, 1909 flow [2024-06-04 16:47:21,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 207 transitions, 1867 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 16:47:21,942 INFO L231 Difference]: Finished difference. Result has 215 places, 182 transitions, 1423 flow [2024-06-04 16:47:21,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1423, PETRI_PLACES=215, PETRI_TRANSITIONS=182} [2024-06-04 16:47:21,943 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-04 16:47:21,943 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 182 transitions, 1423 flow [2024-06-04 16:47:21,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:21,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:21,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:21,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 16:47:21,943 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:21,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1872716398, now seen corresponding path program 3 times [2024-06-04 16:47:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116745675] [2024-06-04 16:47:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116745675] [2024-06-04 16:47:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116745675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:30,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313195050] [2024-06-04 16:47:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:30,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:30,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:30,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 182 transitions, 1423 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:30,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:30,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:30,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:31,254 INFO L124 PetriNetUnfolderBase]: 583/1015 cut-off events. [2024-06-04 16:47:31,254 INFO L125 PetriNetUnfolderBase]: For 76945/76945 co-relation queries the response was YES. [2024-06-04 16:47:31,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6441 conditions, 1015 events. 583/1015 cut-off events. For 76945/76945 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4819 event pairs, 105 based on Foata normal form. 1/1015 useless extension candidates. Maximal degree in co-relation 6332. Up to 955 conditions per place. [2024-06-04 16:47:31,263 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2024-06-04 16:47:31,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 207 transitions, 1939 flow [2024-06-04 16:47:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:47:31,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3581267217630854 [2024-06-04 16:47:31,264 INFO L175 Difference]: Start difference. First operand has 215 places, 182 transitions, 1423 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:47:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 207 transitions, 1939 flow [2024-06-04 16:47:31,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 207 transitions, 1859 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-04 16:47:31,456 INFO L231 Difference]: Finished difference. Result has 219 places, 185 transitions, 1452 flow [2024-06-04 16:47:31,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=219, PETRI_TRANSITIONS=185} [2024-06-04 16:47:31,457 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-04 16:47:31,457 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 185 transitions, 1452 flow [2024-06-04 16:47:31,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:31,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:31,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:31,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 16:47:31,458 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:31,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1988012218, now seen corresponding path program 4 times [2024-06-04 16:47:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084297221] [2024-06-04 16:47:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084297221] [2024-06-04 16:47:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084297221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529397043] [2024-06-04 16:47:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:39,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:39,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 185 transitions, 1452 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:39,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:39,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:39,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:40,137 INFO L124 PetriNetUnfolderBase]: 586/1020 cut-off events. [2024-06-04 16:47:40,138 INFO L125 PetriNetUnfolderBase]: For 79321/79321 co-relation queries the response was YES. [2024-06-04 16:47:40,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 1020 events. 586/1020 cut-off events. For 79321/79321 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4859 event pairs, 73 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 6438. Up to 822 conditions per place. [2024-06-04 16:47:40,147 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 60 changer transitions 0/241 dead transitions. [2024-06-04 16:47:40,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 241 transitions, 2276 flow [2024-06-04 16:47:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 16:47:40,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774104683195592 [2024-06-04 16:47:40,150 INFO L175 Difference]: Start difference. First operand has 219 places, 185 transitions, 1452 flow. Second operand 11 states and 137 transitions. [2024-06-04 16:47:40,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 241 transitions, 2276 flow [2024-06-04 16:47:40,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 241 transitions, 2212 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:47:40,321 INFO L231 Difference]: Finished difference. Result has 227 places, 213 transitions, 1853 flow [2024-06-04 16:47:40,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1853, PETRI_PLACES=227, PETRI_TRANSITIONS=213} [2024-06-04 16:47:40,323 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-04 16:47:40,323 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 213 transitions, 1853 flow [2024-06-04 16:47:40,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:40,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:40,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:40,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 16:47:40,323 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:40,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1988007568, now seen corresponding path program 5 times [2024-06-04 16:47:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:40,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017471594] [2024-06-04 16:47:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017471594] [2024-06-04 16:47:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017471594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271114360] [2024-06-04 16:47:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:48,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:48,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:48,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 213 transitions, 1853 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:48,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:48,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:48,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:49,236 INFO L124 PetriNetUnfolderBase]: 594/1033 cut-off events. [2024-06-04 16:47:49,237 INFO L125 PetriNetUnfolderBase]: For 85201/85201 co-relation queries the response was YES. [2024-06-04 16:47:49,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 1033 events. 594/1033 cut-off events. For 85201/85201 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4950 event pairs, 73 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 6997. Up to 825 conditions per place. [2024-06-04 16:47:49,247 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 65 changer transitions 0/246 dead transitions. [2024-06-04 16:47:49,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 2686 flow [2024-06-04 16:47:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 16:47:49,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292011019283745 [2024-06-04 16:47:49,248 INFO L175 Difference]: Start difference. First operand has 227 places, 213 transitions, 1853 flow. Second operand 11 states and 139 transitions. [2024-06-04 16:47:49,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 2686 flow [2024-06-04 16:47:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 246 transitions, 2552 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-04 16:47:49,433 INFO L231 Difference]: Finished difference. Result has 233 places, 217 transitions, 1930 flow [2024-06-04 16:47:49,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1930, PETRI_PLACES=233, PETRI_TRANSITIONS=217} [2024-06-04 16:47:49,434 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 201 predicate places. [2024-06-04 16:47:49,434 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 217 transitions, 1930 flow [2024-06-04 16:47:49,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:49,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:49,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:49,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 16:47:49,434 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:49,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1988007444, now seen corresponding path program 4 times [2024-06-04 16:47:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967607363] [2024-06-04 16:47:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:47:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:47:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:47:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967607363] [2024-06-04 16:47:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967607363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:47:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:47:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:47:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427755656] [2024-06-04 16:47:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:47:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:47:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:47:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:47:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:47:58,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:47:58,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 217 transitions, 1930 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:58,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:47:58,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:47:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:47:58,627 INFO L124 PetriNetUnfolderBase]: 598/1041 cut-off events. [2024-06-04 16:47:58,627 INFO L125 PetriNetUnfolderBase]: For 88955/88955 co-relation queries the response was YES. [2024-06-04 16:47:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 1041 events. 598/1041 cut-off events. For 88955/88955 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5004 event pairs, 84 based on Foata normal form. 2/1042 useless extension candidates. Maximal degree in co-relation 6792. Up to 942 conditions per place. [2024-06-04 16:47:58,637 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 197 selfloop transitions, 39 changer transitions 0/238 dead transitions. [2024-06-04 16:47:58,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 2480 flow [2024-06-04 16:47:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:47:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:47:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 16:47:58,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608815426997245 [2024-06-04 16:47:58,640 INFO L175 Difference]: Start difference. First operand has 233 places, 217 transitions, 1930 flow. Second operand 11 states and 131 transitions. [2024-06-04 16:47:58,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 2480 flow [2024-06-04 16:47:58,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 2360 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 16:47:58,807 INFO L231 Difference]: Finished difference. Result has 237 places, 218 transitions, 1918 flow [2024-06-04 16:47:58,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1918, PETRI_PLACES=237, PETRI_TRANSITIONS=218} [2024-06-04 16:47:58,807 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 205 predicate places. [2024-06-04 16:47:58,807 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 218 transitions, 1918 flow [2024-06-04 16:47:58,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:47:58,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:47:58,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:47:58,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 16:47:58,808 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:47:58,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:47:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -331988742, now seen corresponding path program 6 times [2024-06-04 16:47:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:47:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468995246] [2024-06-04 16:47:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:47:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:47:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468995246] [2024-06-04 16:48:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468995246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:07,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:48:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201477062] [2024-06-04 16:48:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:48:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:48:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:48:07,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:07,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 218 transitions, 1918 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:07,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:07,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:07,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:07,975 INFO L124 PetriNetUnfolderBase]: 596/1038 cut-off events. [2024-06-04 16:48:07,975 INFO L125 PetriNetUnfolderBase]: For 84528/84528 co-relation queries the response was YES. [2024-06-04 16:48:07,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 1038 events. 596/1038 cut-off events. For 84528/84528 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5011 event pairs, 73 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 6713. Up to 840 conditions per place. [2024-06-04 16:48:07,985 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 61 changer transitions 0/246 dead transitions. [2024-06-04 16:48:07,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 246 transitions, 2521 flow [2024-06-04 16:48:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:48:07,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746556473829201 [2024-06-04 16:48:07,987 INFO L175 Difference]: Start difference. First operand has 237 places, 218 transitions, 1918 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:48:07,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 246 transitions, 2521 flow [2024-06-04 16:48:08,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 246 transitions, 2413 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 16:48:08,161 INFO L231 Difference]: Finished difference. Result has 239 places, 218 transitions, 1937 flow [2024-06-04 16:48:08,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1937, PETRI_PLACES=239, PETRI_TRANSITIONS=218} [2024-06-04 16:48:08,162 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-04 16:48:08,162 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 218 transitions, 1937 flow [2024-06-04 16:48:08,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:08,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:08,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:08,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 16:48:08,162 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:08,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 366671434, now seen corresponding path program 7 times [2024-06-04 16:48:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649229779] [2024-06-04 16:48:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:16,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649229779] [2024-06-04 16:48:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649229779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:16,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:16,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:48:16,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960526463] [2024-06-04 16:48:16,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:16,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:48:16,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:16,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:48:16,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:48:16,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:16,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 218 transitions, 1937 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:16,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:16,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:16,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:16,870 INFO L124 PetriNetUnfolderBase]: 604/1051 cut-off events. [2024-06-04 16:48:16,871 INFO L125 PetriNetUnfolderBase]: For 89880/89880 co-relation queries the response was YES. [2024-06-04 16:48:16,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 1051 events. 604/1051 cut-off events. For 89880/89880 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5093 event pairs, 63 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 6959. Up to 842 conditions per place. [2024-06-04 16:48:16,881 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 189 selfloop transitions, 60 changer transitions 0/251 dead transitions. [2024-06-04 16:48:16,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 2792 flow [2024-06-04 16:48:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 16:48:16,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774104683195592 [2024-06-04 16:48:16,884 INFO L175 Difference]: Start difference. First operand has 239 places, 218 transitions, 1937 flow. Second operand 11 states and 137 transitions. [2024-06-04 16:48:16,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 2792 flow [2024-06-04 16:48:17,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 251 transitions, 2622 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:48:17,071 INFO L231 Difference]: Finished difference. Result has 241 places, 227 transitions, 2008 flow [2024-06-04 16:48:17,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2008, PETRI_PLACES=241, PETRI_TRANSITIONS=227} [2024-06-04 16:48:17,072 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 209 predicate places. [2024-06-04 16:48:17,072 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 227 transitions, 2008 flow [2024-06-04 16:48:17,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:17,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:17,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:17,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 16:48:17,073 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:17,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1662737424, now seen corresponding path program 5 times [2024-06-04 16:48:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:17,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994668206] [2024-06-04 16:48:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994668206] [2024-06-04 16:48:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994668206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:25,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:48:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790557055] [2024-06-04 16:48:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:25,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:48:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:25,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:48:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:48:25,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:25,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 227 transitions, 2008 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:25,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:25,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:25,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:26,437 INFO L124 PetriNetUnfolderBase]: 608/1059 cut-off events. [2024-06-04 16:48:26,437 INFO L125 PetriNetUnfolderBase]: For 95906/95906 co-relation queries the response was YES. [2024-06-04 16:48:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7084 conditions, 1059 events. 608/1059 cut-off events. For 95906/95906 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5138 event pairs, 78 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 6963. Up to 960 conditions per place. [2024-06-04 16:48:26,447 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 206 selfloop transitions, 37 changer transitions 0/245 dead transitions. [2024-06-04 16:48:26,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 245 transitions, 2564 flow [2024-06-04 16:48:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:48:26,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35537190082644626 [2024-06-04 16:48:26,450 INFO L175 Difference]: Start difference. First operand has 241 places, 227 transitions, 2008 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:48:26,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 245 transitions, 2564 flow [2024-06-04 16:48:26,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 245 transitions, 2501 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-04 16:48:26,651 INFO L231 Difference]: Finished difference. Result has 249 places, 228 transitions, 2051 flow [2024-06-04 16:48:26,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2051, PETRI_PLACES=249, PETRI_TRANSITIONS=228} [2024-06-04 16:48:26,652 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 217 predicate places. [2024-06-04 16:48:26,652 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 228 transitions, 2051 flow [2024-06-04 16:48:26,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:26,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:26,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:26,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 16:48:26,653 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:26,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1662732650, now seen corresponding path program 8 times [2024-06-04 16:48:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894067918] [2024-06-04 16:48:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894067918] [2024-06-04 16:48:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894067918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:35,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:48:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714365582] [2024-06-04 16:48:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:48:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:48:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:48:35,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:35,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 228 transitions, 2051 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:35,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:35,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:36,158 INFO L124 PetriNetUnfolderBase]: 617/1074 cut-off events. [2024-06-04 16:48:36,158 INFO L125 PetriNetUnfolderBase]: For 101808/101808 co-relation queries the response was YES. [2024-06-04 16:48:36,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7251 conditions, 1074 events. 617/1074 cut-off events. For 101808/101808 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5224 event pairs, 71 based on Foata normal form. 3/1076 useless extension candidates. Maximal degree in co-relation 7128. Up to 588 conditions per place. [2024-06-04 16:48:36,169 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 152 selfloop transitions, 102 changer transitions 0/256 dead transitions. [2024-06-04 16:48:36,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 2700 flow [2024-06-04 16:48:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-04 16:48:36,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-04 16:48:36,170 INFO L175 Difference]: Start difference. First operand has 249 places, 228 transitions, 2051 flow. Second operand 11 states and 149 transitions. [2024-06-04 16:48:36,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 2700 flow [2024-06-04 16:48:36,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 2604 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 16:48:36,381 INFO L231 Difference]: Finished difference. Result has 251 places, 232 transitions, 2239 flow [2024-06-04 16:48:36,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2239, PETRI_PLACES=251, PETRI_TRANSITIONS=232} [2024-06-04 16:48:36,382 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 219 predicate places. [2024-06-04 16:48:36,382 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 232 transitions, 2239 flow [2024-06-04 16:48:36,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:36,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:36,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 16:48:36,383 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2141142964, now seen corresponding path program 9 times [2024-06-04 16:48:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:36,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770377894] [2024-06-04 16:48:36,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770377894] [2024-06-04 16:48:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770377894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:45,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:48:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350683365] [2024-06-04 16:48:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:45,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:48:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:48:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:48:45,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:45,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 232 transitions, 2239 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:45,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:45,673 INFO L124 PetriNetUnfolderBase]: 626/1089 cut-off events. [2024-06-04 16:48:45,673 INFO L125 PetriNetUnfolderBase]: For 104563/104563 co-relation queries the response was YES. [2024-06-04 16:48:45,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7565 conditions, 1089 events. 626/1089 cut-off events. For 104563/104563 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5320 event pairs, 63 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 7441. Up to 603 conditions per place. [2024-06-04 16:48:45,684 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 160 selfloop transitions, 100 changer transitions 0/262 dead transitions. [2024-06-04 16:48:45,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 262 transitions, 2923 flow [2024-06-04 16:48:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:48:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:48:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 16:48:45,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 16:48:45,693 INFO L175 Difference]: Start difference. First operand has 251 places, 232 transitions, 2239 flow. Second operand 11 states and 150 transitions. [2024-06-04 16:48:45,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 262 transitions, 2923 flow [2024-06-04 16:48:45,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 2675 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-04 16:48:45,908 INFO L231 Difference]: Finished difference. Result has 253 places, 236 transitions, 2279 flow [2024-06-04 16:48:45,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2279, PETRI_PLACES=253, PETRI_TRANSITIONS=236} [2024-06-04 16:48:45,909 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 221 predicate places. [2024-06-04 16:48:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 236 transitions, 2279 flow [2024-06-04 16:48:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:45,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:45,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 16:48:45,909 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:45,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash 373351438, now seen corresponding path program 1 times [2024-06-04 16:48:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758572241] [2024-06-04 16:48:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:48:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:48:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:48:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758572241] [2024-06-04 16:48:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758572241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:48:53,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:48:53,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:48:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805777451] [2024-06-04 16:48:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:48:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:48:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:48:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:48:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:48:54,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:48:54,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 236 transitions, 2279 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:54,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:48:54,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:48:54,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:48:54,624 INFO L124 PetriNetUnfolderBase]: 630/1097 cut-off events. [2024-06-04 16:48:54,624 INFO L125 PetriNetUnfolderBase]: For 103180/103180 co-relation queries the response was YES. [2024-06-04 16:48:54,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 1097 events. 630/1097 cut-off events. For 103180/103180 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5365 event pairs, 69 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 7474. Up to 950 conditions per place. [2024-06-04 16:48:54,636 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 209 selfloop transitions, 45 changer transitions 0/256 dead transitions. [2024-06-04 16:48:54,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 256 transitions, 2851 flow [2024-06-04 16:48:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:48:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:48:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:48:54,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 16:48:54,637 INFO L175 Difference]: Start difference. First operand has 253 places, 236 transitions, 2279 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:48:54,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 256 transitions, 2851 flow [2024-06-04 16:48:54,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 256 transitions, 2599 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-04 16:48:54,884 INFO L231 Difference]: Finished difference. Result has 254 places, 237 transitions, 2133 flow [2024-06-04 16:48:54,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2133, PETRI_PLACES=254, PETRI_TRANSITIONS=237} [2024-06-04 16:48:54,884 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2024-06-04 16:48:54,884 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 237 transitions, 2133 flow [2024-06-04 16:48:54,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:48:54,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:48:54,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:48:54,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 16:48:54,885 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:48:54,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:48:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 373105174, now seen corresponding path program 10 times [2024-06-04 16:48:54,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:48:54,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212669605] [2024-06-04 16:48:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:48:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:48:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:03,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:03,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212669605] [2024-06-04 16:49:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212669605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:03,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:03,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467371964] [2024-06-04 16:49:03,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:03,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:03,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:03,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:03,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 237 transitions, 2133 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:03,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:03,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:03,705 INFO L124 PetriNetUnfolderBase]: 628/1094 cut-off events. [2024-06-04 16:49:03,706 INFO L125 PetriNetUnfolderBase]: For 97581/97581 co-relation queries the response was YES. [2024-06-04 16:49:03,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1094 events. 628/1094 cut-off events. For 97581/97581 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5362 event pairs, 73 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 7201. Up to 896 conditions per place. [2024-06-04 16:49:03,717 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 199 selfloop transitions, 61 changer transitions 0/262 dead transitions. [2024-06-04 16:49:03,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 2759 flow [2024-06-04 16:49:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:49:03,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3691460055096419 [2024-06-04 16:49:03,719 INFO L175 Difference]: Start difference. First operand has 254 places, 237 transitions, 2133 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:49:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 2759 flow [2024-06-04 16:49:03,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 262 transitions, 2636 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:49:03,964 INFO L231 Difference]: Finished difference. Result has 257 places, 239 transitions, 2152 flow [2024-06-04 16:49:03,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=257, PETRI_TRANSITIONS=239} [2024-06-04 16:49:03,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 225 predicate places. [2024-06-04 16:49:03,964 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 239 transitions, 2152 flow [2024-06-04 16:49:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:03,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:03,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:03,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 16:49:03,965 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:03,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 649075062, now seen corresponding path program 2 times [2024-06-04 16:49:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947760990] [2024-06-04 16:49:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947760990] [2024-06-04 16:49:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947760990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:49:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878141069] [2024-06-04 16:49:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:49:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:49:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:49:12,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:12,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 239 transitions, 2152 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:12,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:12,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:12,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:12,572 INFO L124 PetriNetUnfolderBase]: 638/1112 cut-off events. [2024-06-04 16:49:12,572 INFO L125 PetriNetUnfolderBase]: For 103641/103641 co-relation queries the response was YES. [2024-06-04 16:49:12,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 1112 events. 638/1112 cut-off events. For 103641/103641 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5485 event pairs, 67 based on Foata normal form. 2/1113 useless extension candidates. Maximal degree in co-relation 7330. Up to 961 conditions per place. [2024-06-04 16:49:12,584 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 213 selfloop transitions, 44 changer transitions 0/259 dead transitions. [2024-06-04 16:49:12,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 259 transitions, 2747 flow [2024-06-04 16:49:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:49:12,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-04 16:49:12,585 INFO L175 Difference]: Start difference. First operand has 257 places, 239 transitions, 2152 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:49:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 259 transitions, 2747 flow [2024-06-04 16:49:12,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 259 transitions, 2641 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:49:12,840 INFO L231 Difference]: Finished difference. Result has 262 places, 243 transitions, 2188 flow [2024-06-04 16:49:12,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2188, PETRI_PLACES=262, PETRI_TRANSITIONS=243} [2024-06-04 16:49:12,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2024-06-04 16:49:12,841 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 243 transitions, 2188 flow [2024-06-04 16:49:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:12,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:12,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:12,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 16:49:12,841 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:12,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 419386452, now seen corresponding path program 3 times [2024-06-04 16:49:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368408365] [2024-06-04 16:49:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:21,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:21,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368408365] [2024-06-04 16:49:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368408365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243682550] [2024-06-04 16:49:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:21,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:21,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 243 transitions, 2188 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:21,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:21,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:22,240 INFO L124 PetriNetUnfolderBase]: 642/1120 cut-off events. [2024-06-04 16:49:22,240 INFO L125 PetriNetUnfolderBase]: For 105923/105923 co-relation queries the response was YES. [2024-06-04 16:49:22,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7505 conditions, 1120 events. 642/1120 cut-off events. For 105923/105923 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5529 event pairs, 69 based on Foata normal form. 2/1121 useless extension candidates. Maximal degree in co-relation 7376. Up to 969 conditions per place. [2024-06-04 16:49:22,251 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 218 selfloop transitions, 42 changer transitions 0/262 dead transitions. [2024-06-04 16:49:22,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 2780 flow [2024-06-04 16:49:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:49:22,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-04 16:49:22,252 INFO L175 Difference]: Start difference. First operand has 262 places, 243 transitions, 2188 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:49:22,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 2780 flow [2024-06-04 16:49:22,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 2701 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 16:49:22,510 INFO L231 Difference]: Finished difference. Result has 268 places, 245 transitions, 2228 flow [2024-06-04 16:49:22,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2228, PETRI_PLACES=268, PETRI_TRANSITIONS=245} [2024-06-04 16:49:22,511 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 236 predicate places. [2024-06-04 16:49:22,511 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 245 transitions, 2228 flow [2024-06-04 16:49:22,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:22,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:22,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 16:49:22,514 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:22,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 897723482, now seen corresponding path program 11 times [2024-06-04 16:49:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179361407] [2024-06-04 16:49:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179361407] [2024-06-04 16:49:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179361407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607521451] [2024-06-04 16:49:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:29,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:29,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:29,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 245 transitions, 2228 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:29,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:29,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:29,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:29,614 INFO L124 PetriNetUnfolderBase]: 645/1125 cut-off events. [2024-06-04 16:49:29,615 INFO L125 PetriNetUnfolderBase]: For 104619/104619 co-relation queries the response was YES. [2024-06-04 16:49:29,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7576 conditions, 1125 events. 645/1125 cut-off events. For 104619/104619 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5588 event pairs, 73 based on Foata normal form. 1/1125 useless extension candidates. Maximal degree in co-relation 7445. Up to 927 conditions per place. [2024-06-04 16:49:29,624 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 208 selfloop transitions, 61 changer transitions 0/271 dead transitions. [2024-06-04 16:49:29,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 2915 flow [2024-06-04 16:49:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 16:49:29,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-04 16:49:29,626 INFO L175 Difference]: Start difference. First operand has 268 places, 245 transitions, 2228 flow. Second operand 11 states and 135 transitions. [2024-06-04 16:49:29,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 2915 flow [2024-06-04 16:49:29,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 2823 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:49:29,895 INFO L231 Difference]: Finished difference. Result has 273 places, 252 transitions, 2347 flow [2024-06-04 16:49:29,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2347, PETRI_PLACES=273, PETRI_TRANSITIONS=252} [2024-06-04 16:49:29,896 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 241 predicate places. [2024-06-04 16:49:29,896 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 252 transitions, 2347 flow [2024-06-04 16:49:29,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:29,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:29,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:29,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 16:49:29,897 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:29,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1333282290, now seen corresponding path program 6 times [2024-06-04 16:49:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88605878] [2024-06-04 16:49:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:38,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:38,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88605878] [2024-06-04 16:49:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88605878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:38,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712917078] [2024-06-04 16:49:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:38,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:38,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:38,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:38,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 252 transitions, 2347 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:38,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:38,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:38,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:39,288 INFO L124 PetriNetUnfolderBase]: 649/1133 cut-off events. [2024-06-04 16:49:39,289 INFO L125 PetriNetUnfolderBase]: For 111304/111304 co-relation queries the response was YES. [2024-06-04 16:49:39,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7735 conditions, 1133 events. 649/1133 cut-off events. For 111304/111304 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5639 event pairs, 78 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 7602. Up to 1034 conditions per place. [2024-06-04 16:49:39,300 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 229 selfloop transitions, 36 changer transitions 0/267 dead transitions. [2024-06-04 16:49:39,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 267 transitions, 2939 flow [2024-06-04 16:49:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 16:49:39,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.349862258953168 [2024-06-04 16:49:39,302 INFO L175 Difference]: Start difference. First operand has 273 places, 252 transitions, 2347 flow. Second operand 11 states and 127 transitions. [2024-06-04 16:49:39,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 267 transitions, 2939 flow [2024-06-04 16:49:39,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 267 transitions, 2809 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:49:39,595 INFO L231 Difference]: Finished difference. Result has 278 places, 253 transitions, 2323 flow [2024-06-04 16:49:39,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2323, PETRI_PLACES=278, PETRI_TRANSITIONS=253} [2024-06-04 16:49:39,595 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2024-06-04 16:49:39,595 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 253 transitions, 2323 flow [2024-06-04 16:49:39,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:39,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:39,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:39,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 16:49:39,596 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:39,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 891294392, now seen corresponding path program 12 times [2024-06-04 16:49:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297117199] [2024-06-04 16:49:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297117199] [2024-06-04 16:49:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297117199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:48,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:48,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348990954] [2024-06-04 16:49:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:48,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:48,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 253 transitions, 2323 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:48,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:48,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:48,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:49,005 INFO L124 PetriNetUnfolderBase]: 658/1148 cut-off events. [2024-06-04 16:49:49,005 INFO L125 PetriNetUnfolderBase]: For 118121/118121 co-relation queries the response was YES. [2024-06-04 16:49:49,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 1148 events. 658/1148 cut-off events. For 118121/118121 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5736 event pairs, 67 based on Foata normal form. 3/1150 useless extension candidates. Maximal degree in co-relation 7670. Up to 654 conditions per place. [2024-06-04 16:49:49,018 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 177 selfloop transitions, 100 changer transitions 0/279 dead transitions. [2024-06-04 16:49:49,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 3029 flow [2024-06-04 16:49:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:49:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:49:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-04 16:49:49,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-04 16:49:49,019 INFO L175 Difference]: Start difference. First operand has 278 places, 253 transitions, 2323 flow. Second operand 11 states and 147 transitions. [2024-06-04 16:49:49,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 3029 flow [2024-06-04 16:49:49,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 2933 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 16:49:49,305 INFO L231 Difference]: Finished difference. Result has 280 places, 256 transitions, 2508 flow [2024-06-04 16:49:49,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2508, PETRI_PLACES=280, PETRI_TRANSITIONS=256} [2024-06-04 16:49:49,305 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 248 predicate places. [2024-06-04 16:49:49,305 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 256 transitions, 2508 flow [2024-06-04 16:49:49,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:49,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:49,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:49,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 16:49:49,306 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:49,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1127956886, now seen corresponding path program 4 times [2024-06-04 16:49:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183306506] [2024-06-04 16:49:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:49,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:49:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:49:56,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:49:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183306506] [2024-06-04 16:49:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183306506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:49:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:49:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:49:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089140396] [2024-06-04 16:49:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:49:56,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:49:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:49:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:49:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:49:57,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:49:57,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 256 transitions, 2508 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:57,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:49:57,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:49:57,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:49:57,548 INFO L124 PetriNetUnfolderBase]: 672/1174 cut-off events. [2024-06-04 16:49:57,549 INFO L125 PetriNetUnfolderBase]: For 125143/125143 co-relation queries the response was YES. [2024-06-04 16:49:57,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8314 conditions, 1174 events. 672/1174 cut-off events. For 125143/125143 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5873 event pairs, 64 based on Foata normal form. 2/1175 useless extension candidates. Maximal degree in co-relation 8181. Up to 971 conditions per place. [2024-06-04 16:49:57,561 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 222 selfloop transitions, 53 changer transitions 0/277 dead transitions. [2024-06-04 16:49:57,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 277 transitions, 3328 flow [2024-06-04 16:49:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:49:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:49:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:49:57,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 16:49:57,563 INFO L175 Difference]: Start difference. First operand has 280 places, 256 transitions, 2508 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:49:57,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 277 transitions, 3328 flow [2024-06-04 16:49:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 277 transitions, 3071 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-06-04 16:49:57,899 INFO L231 Difference]: Finished difference. Result has 282 places, 260 transitions, 2432 flow [2024-06-04 16:49:57,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2432, PETRI_PLACES=282, PETRI_TRANSITIONS=260} [2024-06-04 16:49:57,900 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 250 predicate places. [2024-06-04 16:49:57,900 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 260 transitions, 2432 flow [2024-06-04 16:49:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:49:57,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:49:57,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:49:57,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 16:49:57,900 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:49:57,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:49:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 891289742, now seen corresponding path program 13 times [2024-06-04 16:49:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:49:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882256817] [2024-06-04 16:49:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:49:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:49:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882256817] [2024-06-04 16:50:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882256817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37802283] [2024-06-04 16:50:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:06,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:06,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:07,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:07,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 260 transitions, 2432 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:07,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:07,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:07,837 INFO L124 PetriNetUnfolderBase]: 690/1203 cut-off events. [2024-06-04 16:50:07,837 INFO L125 PetriNetUnfolderBase]: For 136526/136526 co-relation queries the response was YES. [2024-06-04 16:50:07,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 1203 events. 690/1203 cut-off events. For 136526/136526 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6078 event pairs, 68 based on Foata normal form. 1/1203 useless extension candidates. Maximal degree in co-relation 8615. Up to 675 conditions per place. [2024-06-04 16:50:07,848 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 180 selfloop transitions, 109 changer transitions 0/291 dead transitions. [2024-06-04 16:50:07,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 3410 flow [2024-06-04 16:50:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:50:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:50:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2024-06-04 16:50:07,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-04 16:50:07,849 INFO L175 Difference]: Start difference. First operand has 282 places, 260 transitions, 2432 flow. Second operand 12 states and 160 transitions. [2024-06-04 16:50:07,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 3410 flow [2024-06-04 16:50:08,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 291 transitions, 3353 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:50:08,240 INFO L231 Difference]: Finished difference. Result has 290 places, 265 transitions, 2745 flow [2024-06-04 16:50:08,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2745, PETRI_PLACES=290, PETRI_TRANSITIONS=265} [2024-06-04 16:50:08,240 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 258 predicate places. [2024-06-04 16:50:08,241 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 265 transitions, 2745 flow [2024-06-04 16:50:08,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:08,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:08,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 16:50:08,241 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:08,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash 412884078, now seen corresponding path program 14 times [2024-06-04 16:50:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146826209] [2024-06-04 16:50:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:16,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:16,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146826209] [2024-06-04 16:50:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146826209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:16,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835738206] [2024-06-04 16:50:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:16,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:16,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:16,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:16,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:16,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 265 transitions, 2745 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:16,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:16,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:16,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:17,330 INFO L124 PetriNetUnfolderBase]: 699/1218 cut-off events. [2024-06-04 16:50:17,331 INFO L125 PetriNetUnfolderBase]: For 149588/149588 co-relation queries the response was YES. [2024-06-04 16:50:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 1218 events. 699/1218 cut-off events. For 149588/149588 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6163 event pairs, 60 based on Foata normal form. 3/1220 useless extension candidates. Maximal degree in co-relation 9115. Up to 724 conditions per place. [2024-06-04 16:50:17,344 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 190 selfloop transitions, 97 changer transitions 0/289 dead transitions. [2024-06-04 16:50:17,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 289 transitions, 3470 flow [2024-06-04 16:50:17,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:50:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:50:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-04 16:50:17,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-04 16:50:17,345 INFO L175 Difference]: Start difference. First operand has 290 places, 265 transitions, 2745 flow. Second operand 11 states and 148 transitions. [2024-06-04 16:50:17,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 289 transitions, 3470 flow [2024-06-04 16:50:17,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 3255 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-04 16:50:17,745 INFO L231 Difference]: Finished difference. Result has 293 places, 268 transitions, 2820 flow [2024-06-04 16:50:17,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2820, PETRI_PLACES=293, PETRI_TRANSITIONS=268} [2024-06-04 16:50:17,746 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 261 predicate places. [2024-06-04 16:50:17,746 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 268 transitions, 2820 flow [2024-06-04 16:50:17,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:17,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:17,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:17,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 16:50:17,747 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:17,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 640785228, now seen corresponding path program 15 times [2024-06-04 16:50:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064971693] [2024-06-04 16:50:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:26,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064971693] [2024-06-04 16:50:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064971693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:26,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:26,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076396580] [2024-06-04 16:50:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:26,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:26,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:26,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 268 transitions, 2820 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:26,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:26,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:26,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:26,696 INFO L124 PetriNetUnfolderBase]: 697/1215 cut-off events. [2024-06-04 16:50:26,696 INFO L125 PetriNetUnfolderBase]: For 138321/138321 co-relation queries the response was YES. [2024-06-04 16:50:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9211 conditions, 1215 events. 697/1215 cut-off events. For 138321/138321 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6151 event pairs, 74 based on Foata normal form. 1/1215 useless extension candidates. Maximal degree in co-relation 9071. Up to 1017 conditions per place. [2024-06-04 16:50:26,710 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 219 selfloop transitions, 68 changer transitions 0/289 dead transitions. [2024-06-04 16:50:26,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 289 transitions, 3505 flow [2024-06-04 16:50:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:50:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:50:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:50:26,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:50:26,711 INFO L175 Difference]: Start difference. First operand has 293 places, 268 transitions, 2820 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:50:26,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 289 transitions, 3505 flow [2024-06-04 16:50:27,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 289 transitions, 3272 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-04 16:50:27,134 INFO L231 Difference]: Finished difference. Result has 296 places, 271 transitions, 2779 flow [2024-06-04 16:50:27,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2779, PETRI_PLACES=296, PETRI_TRANSITIONS=271} [2024-06-04 16:50:27,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-04 16:50:27,135 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 271 transitions, 2779 flow [2024-06-04 16:50:27,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:27,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:27,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:27,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 16:50:27,135 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:27,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 641031492, now seen corresponding path program 5 times [2024-06-04 16:50:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:27,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229154704] [2024-06-04 16:50:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229154704] [2024-06-04 16:50:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229154704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:35,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784477485] [2024-06-04 16:50:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:35,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:35,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:35,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 271 transitions, 2779 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:35,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:35,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:35,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:36,256 INFO L124 PetriNetUnfolderBase]: 694/1210 cut-off events. [2024-06-04 16:50:36,256 INFO L125 PetriNetUnfolderBase]: For 136063/136063 co-relation queries the response was YES. [2024-06-04 16:50:36,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8892 conditions, 1210 events. 694/1210 cut-off events. For 136063/136063 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6106 event pairs, 64 based on Foata normal form. 2/1211 useless extension candidates. Maximal degree in co-relation 8750. Up to 1059 conditions per place. [2024-06-04 16:50:36,269 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 243 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-04 16:50:36,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 288 transitions, 3399 flow [2024-06-04 16:50:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:50:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:50:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:50:36,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 16:50:36,270 INFO L175 Difference]: Start difference. First operand has 296 places, 271 transitions, 2779 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:50:36,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 288 transitions, 3399 flow [2024-06-04 16:50:36,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 288 transitions, 3221 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:50:36,652 INFO L231 Difference]: Finished difference. Result has 298 places, 271 transitions, 2691 flow [2024-06-04 16:50:36,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2601, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2691, PETRI_PLACES=298, PETRI_TRANSITIONS=271} [2024-06-04 16:50:36,653 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 266 predicate places. [2024-06-04 16:50:36,653 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 271 transitions, 2691 flow [2024-06-04 16:50:36,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:36,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:36,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:36,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 16:50:36,654 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:36,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 848971748, now seen corresponding path program 16 times [2024-06-04 16:50:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491343032] [2024-06-04 16:50:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491343032] [2024-06-04 16:50:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491343032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:45,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579228167] [2024-06-04 16:50:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:45,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:45,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:45,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 271 transitions, 2691 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:45,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:45,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:45,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:46,279 INFO L124 PetriNetUnfolderBase]: 703/1225 cut-off events. [2024-06-04 16:50:46,280 INFO L125 PetriNetUnfolderBase]: For 143826/143826 co-relation queries the response was YES. [2024-06-04 16:50:46,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 1225 events. 703/1225 cut-off events. For 143826/143826 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6208 event pairs, 75 based on Foata normal form. 3/1227 useless extension candidates. Maximal degree in co-relation 8847. Up to 1025 conditions per place. [2024-06-04 16:50:46,294 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 248 selfloop transitions, 45 changer transitions 0/295 dead transitions. [2024-06-04 16:50:46,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 295 transitions, 3441 flow [2024-06-04 16:50:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:50:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:50:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:50:46,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746556473829201 [2024-06-04 16:50:46,295 INFO L175 Difference]: Start difference. First operand has 298 places, 271 transitions, 2691 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:50:46,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 295 transitions, 3441 flow [2024-06-04 16:50:46,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 295 transitions, 3325 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:50:46,697 INFO L231 Difference]: Finished difference. Result has 299 places, 274 transitions, 2756 flow [2024-06-04 16:50:46,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2756, PETRI_PLACES=299, PETRI_TRANSITIONS=274} [2024-06-04 16:50:46,713 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 267 predicate places. [2024-06-04 16:50:46,713 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 274 transitions, 2756 flow [2024-06-04 16:50:46,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:46,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:46,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:46,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 16:50:46,713 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:46,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash -239894634, now seen corresponding path program 6 times [2024-06-04 16:50:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166458269] [2024-06-04 16:50:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:50:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:50:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:50:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166458269] [2024-06-04 16:50:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166458269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:50:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:50:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:50:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484695978] [2024-06-04 16:50:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:50:54,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:50:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:50:54,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:50:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:50:54,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:50:54,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 274 transitions, 2756 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:54,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:50:54,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:50:54,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:50:55,219 INFO L124 PetriNetUnfolderBase]: 713/1243 cut-off events. [2024-06-04 16:50:55,219 INFO L125 PetriNetUnfolderBase]: For 141855/141855 co-relation queries the response was YES. [2024-06-04 16:50:55,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9151 conditions, 1243 events. 713/1243 cut-off events. For 141855/141855 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6335 event pairs, 79 based on Foata normal form. 2/1244 useless extension candidates. Maximal degree in co-relation 9007. Up to 1159 conditions per place. [2024-06-04 16:50:55,233 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 263 selfloop transitions, 28 changer transitions 0/293 dead transitions. [2024-06-04 16:50:55,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 293 transitions, 3437 flow [2024-06-04 16:50:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:50:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:50:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:50:55,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-04 16:50:55,235 INFO L175 Difference]: Start difference. First operand has 299 places, 274 transitions, 2756 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:50:55,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 293 transitions, 3437 flow [2024-06-04 16:50:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 3276 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-04 16:50:55,615 INFO L231 Difference]: Finished difference. Result has 301 places, 278 transitions, 2718 flow [2024-06-04 16:50:55,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2718, PETRI_PLACES=301, PETRI_TRANSITIONS=278} [2024-06-04 16:50:55,616 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-04 16:50:55,616 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 278 transitions, 2718 flow [2024-06-04 16:50:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:50:55,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:50:55,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:50:55,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 16:50:55,616 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:50:55,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:50:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1544833882, now seen corresponding path program 17 times [2024-06-04 16:50:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:50:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109454548] [2024-06-04 16:50:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:50:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:50:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:04,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:04,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109454548] [2024-06-04 16:51:04,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109454548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:51:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805285704] [2024-06-04 16:51:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:04,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:51:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:51:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:51:04,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:51:04,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 278 transitions, 2718 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:04,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:04,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:51:04,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:05,597 INFO L124 PetriNetUnfolderBase]: 722/1258 cut-off events. [2024-06-04 16:51:05,597 INFO L125 PetriNetUnfolderBase]: For 149596/149596 co-relation queries the response was YES. [2024-06-04 16:51:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 1258 events. 722/1258 cut-off events. For 149596/149596 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6417 event pairs, 71 based on Foata normal form. 3/1260 useless extension candidates. Maximal degree in co-relation 9056. Up to 1050 conditions per place. [2024-06-04 16:51:05,610 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 251 selfloop transitions, 48 changer transitions 0/301 dead transitions. [2024-06-04 16:51:05,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 301 transitions, 3480 flow [2024-06-04 16:51:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:51:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:51:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 16:51:05,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-04 16:51:05,611 INFO L175 Difference]: Start difference. First operand has 301 places, 278 transitions, 2718 flow. Second operand 11 states and 135 transitions. [2024-06-04 16:51:05,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 301 transitions, 3480 flow [2024-06-04 16:51:06,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 301 transitions, 3410 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:51:06,044 INFO L231 Difference]: Finished difference. Result has 305 places, 281 transitions, 2841 flow [2024-06-04 16:51:06,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2841, PETRI_PLACES=305, PETRI_TRANSITIONS=281} [2024-06-04 16:51:06,045 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 273 predicate places. [2024-06-04 16:51:06,045 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 281 transitions, 2841 flow [2024-06-04 16:51:06,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:06,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:06,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:06,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 16:51:06,046 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:06,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1551089992, now seen corresponding path program 18 times [2024-06-04 16:51:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781547089] [2024-06-04 16:51:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781547089] [2024-06-04 16:51:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781547089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:14,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:51:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782630568] [2024-06-04 16:51:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:14,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:51:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:51:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:51:14,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:51:14,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 281 transitions, 2841 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:14,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:14,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:51:14,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:15,152 INFO L124 PetriNetUnfolderBase]: 725/1263 cut-off events. [2024-06-04 16:51:15,153 INFO L125 PetriNetUnfolderBase]: For 142664/142664 co-relation queries the response was YES. [2024-06-04 16:51:15,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9360 conditions, 1263 events. 725/1263 cut-off events. For 142664/142664 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6439 event pairs, 79 based on Foata normal form. 1/1263 useless extension candidates. Maximal degree in co-relation 9213. Up to 1191 conditions per place. [2024-06-04 16:51:15,167 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 264 selfloop transitions, 33 changer transitions 0/299 dead transitions. [2024-06-04 16:51:15,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 299 transitions, 3561 flow [2024-06-04 16:51:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:51:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:51:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-04 16:51:15,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33608815426997246 [2024-06-04 16:51:15,169 INFO L175 Difference]: Start difference. First operand has 305 places, 281 transitions, 2841 flow. Second operand 11 states and 122 transitions. [2024-06-04 16:51:15,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 299 transitions, 3561 flow [2024-06-04 16:51:15,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 299 transitions, 3390 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-04 16:51:15,631 INFO L231 Difference]: Finished difference. Result has 308 places, 286 transitions, 2835 flow [2024-06-04 16:51:15,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2672, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2835, PETRI_PLACES=308, PETRI_TRANSITIONS=286} [2024-06-04 16:51:15,631 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 276 predicate places. [2024-06-04 16:51:15,631 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 286 transitions, 2835 flow [2024-06-04 16:51:15,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:15,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:15,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:15,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 16:51:15,632 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:15,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1314610708, now seen corresponding path program 7 times [2024-06-04 16:51:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787598785] [2024-06-04 16:51:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787598785] [2024-06-04 16:51:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787598785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:51:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774997423] [2024-06-04 16:51:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:24,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:51:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:51:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:51:24,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:51:24,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 286 transitions, 2835 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:24,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:24,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:51:24,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:24,887 INFO L124 PetriNetUnfolderBase]: 729/1271 cut-off events. [2024-06-04 16:51:24,887 INFO L125 PetriNetUnfolderBase]: For 149948/149948 co-relation queries the response was YES. [2024-06-04 16:51:24,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9305 conditions, 1271 events. 729/1271 cut-off events. For 149948/149948 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6530 event pairs, 81 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 9156. Up to 1187 conditions per place. [2024-06-04 16:51:24,904 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 270 selfloop transitions, 29 changer transitions 0/301 dead transitions. [2024-06-04 16:51:24,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 301 transitions, 3499 flow [2024-06-04 16:51:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:51:24,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:51:24,907 INFO L175 Difference]: Start difference. First operand has 308 places, 286 transitions, 2835 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:51:24,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 301 transitions, 3499 flow [2024-06-04 16:51:25,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 301 transitions, 3324 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-04 16:51:25,328 INFO L231 Difference]: Finished difference. Result has 311 places, 288 transitions, 2765 flow [2024-06-04 16:51:25,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2765, PETRI_PLACES=311, PETRI_TRANSITIONS=288} [2024-06-04 16:51:25,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 279 predicate places. [2024-06-04 16:51:25,329 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 288 transitions, 2765 flow [2024-06-04 16:51:25,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:25,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:25,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:25,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 16:51:25,329 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:25,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1314600478, now seen corresponding path program 8 times [2024-06-04 16:51:25,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:25,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142191500] [2024-06-04 16:51:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:51:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:51:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:51:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142191500] [2024-06-04 16:51:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142191500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:51:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:51:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:51:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185532036] [2024-06-04 16:51:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:51:33,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:51:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:51:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:51:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:51:33,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:51:33,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 288 transitions, 2765 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:33,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:51:33,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:51:33,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:51:34,134 INFO L124 PetriNetUnfolderBase]: 740/1292 cut-off events. [2024-06-04 16:51:34,134 INFO L125 PetriNetUnfolderBase]: For 163189/163189 co-relation queries the response was YES. [2024-06-04 16:51:34,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9616 conditions, 1292 events. 740/1292 cut-off events. For 163189/163189 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6666 event pairs, 84 based on Foata normal form. 2/1293 useless extension candidates. Maximal degree in co-relation 9465. Up to 1179 conditions per place. [2024-06-04 16:51:34,149 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 270 selfloop transitions, 32 changer transitions 0/304 dead transitions. [2024-06-04 16:51:34,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 304 transitions, 3651 flow [2024-06-04 16:51:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:51:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:51:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 16:51:34,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2024-06-04 16:51:34,150 INFO L175 Difference]: Start difference. First operand has 311 places, 288 transitions, 2765 flow. Second operand 10 states and 117 transitions. [2024-06-04 16:51:34,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 304 transitions, 3651 flow [2024-06-04 16:51:34,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 304 transitions, 3592 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 16:51:34,651 INFO L231 Difference]: Finished difference. Result has 316 places, 290 transitions, 2820 flow [2024-06-04 16:51:34,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2820, PETRI_PLACES=316, PETRI_TRANSITIONS=290} [2024-06-04 16:51:34,651 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 284 predicate places. [2024-06-04 16:51:34,651 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 290 transitions, 2820 flow [2024-06-04 16:51:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:51:34,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:51:34,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:51:34,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 16:51:34,652 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:51:34,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:51:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1544587618, now seen corresponding path program 9 times [2024-06-04 16:51:34,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:51:34,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037199679] [2024-06-04 16:51:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:51:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:51:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15